/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:57:37,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:57:37,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:57:37,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:57:37,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:57:37,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:57:37,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:57:37,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:57:37,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:57:37,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:57:37,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:57:37,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:57:37,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:57:37,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:57:37,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:57:37,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:57:37,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:57:37,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:57:37,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:57:37,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:57:37,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:57:37,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:57:37,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:57:37,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:57:37,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:57:37,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:57:37,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:57:37,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:57:37,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:57:37,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:57:37,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:57:37,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:57:37,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:57:37,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:57:37,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:57:37,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:57:37,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:57:37,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:57:37,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:57:37,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:57:37,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:57:37,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-02-10 19:57:38,005 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:57:38,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:57:38,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:57:38,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:57:38,007 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:57:38,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:57:38,007 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:57:38,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:57:38,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:57:38,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:57:38,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:57:38,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:57:38,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:57:38,009 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:57:38,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:57:38,009 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:57:38,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:57:38,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:57:38,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:57:38,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:57:38,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:57:38,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:57:38,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:57:38,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:57:38,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:57:38,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:57:38,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:57:38,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:57:38,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:57:38,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:57:38,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:57:38,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:57:38,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:57:38,330 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:57:38,331 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl [2020-02-10 19:57:38,331 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl' [2020-02-10 19:57:38,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:57:38,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:57:38,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:57:38,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:57:38,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:57:38,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:57:38,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:57:38,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:57:38,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:57:38,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:57:38,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:57:38,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:57:38,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:57:38,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:57:38,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:57:38,515 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:57:38,516 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:57:38,517 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:57:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:57:38,518 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:57:38,518 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:57:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:57:38,518 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:57:38,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:57:38,519 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:57:38,519 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:57:38,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:57:38,520 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:57:38,520 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:57:38,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 19:57:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 19:57:38,521 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 19:57:38,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:57:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:57:38,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:57:38,522 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:57:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:57:38,522 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:57:38,523 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:57:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:57:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:57:38,531 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_10 given in one single declaration [2020-02-10 19:57:38,532 INFO L130 BoogieDeclarations]: Found specification of procedure set_10 [2020-02-10 19:57:38,532 INFO L138 BoogieDeclarations]: Found implementation of procedure set_10 [2020-02-10 19:57:38,532 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:57:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:57:38,533 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:57:38,533 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 19:57:38,533 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 19:57:38,534 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 19:57:38,535 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 19:57:38,825 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:57:38,825 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:57:38,829 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:57:38 BoogieIcfgContainer [2020-02-10 19:57:38,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:57:38,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:57:38,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:57:38,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:57:38,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/2) ... [2020-02-10 19:57:38,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209b5a30 and model type example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:57:38, skipping insertion in model container [2020-02-10 19:57:38,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:57:38" (2/2) ... [2020-02-10 19:57:38,837 INFO L109 eAbstractionObserver]: Analyzing ICFG example_11.bpl [2020-02-10 19:57:38,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:57:38,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:57:38,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:57:38,857 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:57:39,146 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-02-10 19:57:39,180 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:57:39,180 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:57:39,181 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:57:39,181 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:57:39,181 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:57:39,181 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:57:39,182 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:57:39,182 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:57:39,215 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 168 transitions [2020-02-10 19:57:39,217 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 19:57:49,327 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 19:57:49,327 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 19:57:49,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 19:57:49,694 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 19:57:59,625 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 19:57:59,625 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 19:57:59,702 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 19:57:59,886 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5060 [2020-02-10 19:57:59,887 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:58:00,193 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1375 [2020-02-10 19:58:00,194 INFO L214 etLargeBlockEncoding]: Total number of compositions: 12 [2020-02-10 19:58:00,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 156 transitions [2020-02-10 19:59:40,416 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 179196 states. [2020-02-10 19:59:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 179196 states. [2020-02-10 19:59:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 19:59:41,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:41,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:41,155 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1136777304, now seen corresponding path program 1 times [2020-02-10 19:59:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:41,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057617777] [2020-02-10 19:59:41,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:41,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:59:41,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057617777] [2020-02-10 19:59:41,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:41,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:59:41,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525927503] [2020-02-10 19:59:41,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:59:41,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:59:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:59:41,359 INFO L87 Difference]: Start difference. First operand 179196 states. Second operand 3 states. [2020-02-10 19:59:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:43,468 INFO L93 Difference]: Finished difference Result 146172 states and 1021320 transitions. [2020-02-10 19:59:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:59:43,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 19:59:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:44,608 INFO L225 Difference]: With dead ends: 146172 [2020-02-10 19:59:44,616 INFO L226 Difference]: Without dead ends: 146171 [2020-02-10 19:59:44,618 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:59:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146171 states. [2020-02-10 20:00:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146171 to 146171. [2020-02-10 20:00:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146171 states. [2020-02-10 20:00:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146171 states to 146171 states and 1021319 transitions. [2020-02-10 20:00:11,006 INFO L78 Accepts]: Start accepts. Automaton has 146171 states and 1021319 transitions. Word has length 34 [2020-02-10 20:00:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:11,007 INFO L479 AbstractCegarLoop]: Abstraction has 146171 states and 1021319 transitions. [2020-02-10 20:00:11,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:00:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 146171 states and 1021319 transitions. [2020-02-10 20:00:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:00:11,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:11,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:11,552 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -356386054, now seen corresponding path program 1 times [2020-02-10 20:00:11,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:11,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473052604] [2020-02-10 20:00:11,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:11,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473052604] [2020-02-10 20:00:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:11,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:00:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077954967] [2020-02-10 20:00:11,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:00:11,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:11,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:00:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:00:11,629 INFO L87 Difference]: Start difference. First operand 146171 states and 1021319 transitions. Second operand 3 states. [2020-02-10 20:00:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:21,865 INFO L93 Difference]: Finished difference Result 145147 states and 1010567 transitions. [2020-02-10 20:00:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:00:21,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:00:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:22,784 INFO L225 Difference]: With dead ends: 145147 [2020-02-10 20:00:22,784 INFO L226 Difference]: Without dead ends: 145147 [2020-02-10 20:00:22,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:00:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145147 states. [2020-02-10 20:00:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145147 to 145147. [2020-02-10 20:00:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145147 states. [2020-02-10 20:00:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145147 states to 145147 states and 1010567 transitions. [2020-02-10 20:00:34,778 INFO L78 Accepts]: Start accepts. Automaton has 145147 states and 1010567 transitions. Word has length 34 [2020-02-10 20:00:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:34,778 INFO L479 AbstractCegarLoop]: Abstraction has 145147 states and 1010567 transitions. [2020-02-10 20:00:34,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:00:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 145147 states and 1010567 transitions. [2020-02-10 20:00:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:00:44,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:44,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:44,031 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 935006680, now seen corresponding path program 1 times [2020-02-10 20:00:44,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:44,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988515598] [2020-02-10 20:00:44,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00: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 20:00:44,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988515598] [2020-02-10 20:00:44,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:44,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:00:44,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005793523] [2020-02-10 20:00:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:00:44,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:00:44,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:00:44,065 INFO L87 Difference]: Start difference. First operand 145147 states and 1010567 transitions. Second operand 3 states. [2020-02-10 20:00:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:45,911 INFO L93 Difference]: Finished difference Result 139515 states and 956551 transitions. [2020-02-10 20:00:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:00:45,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:00:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:46,517 INFO L225 Difference]: With dead ends: 139515 [2020-02-10 20:00:46,517 INFO L226 Difference]: Without dead ends: 139515 [2020-02-10 20:00:46,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:00:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139515 states. [2020-02-10 20:01:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139515 to 139515. [2020-02-10 20:01:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139515 states. [2020-02-10 20:01:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139515 states to 139515 states and 956551 transitions. [2020-02-10 20:01:03,120 INFO L78 Accepts]: Start accepts. Automaton has 139515 states and 956551 transitions. Word has length 34 [2020-02-10 20:01:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:03,120 INFO L479 AbstractCegarLoop]: Abstraction has 139515 states and 956551 transitions. [2020-02-10 20:01:03,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 139515 states and 956551 transitions. [2020-02-10 20:01:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:11,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:11,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:11,687 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash -457460980, now seen corresponding path program 1 times [2020-02-10 20:01:11,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:11,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620457213] [2020-02-10 20:01:11,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:11,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 20:01:11,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620457213] [2020-02-10 20:01:11,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:11,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:11,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37345365] [2020-02-10 20:01:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:11,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:11,720 INFO L87 Difference]: Start difference. First operand 139515 states and 956551 transitions. Second operand 3 states. [2020-02-10 20:01:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:12,393 INFO L93 Difference]: Finished difference Result 88603 states and 587879 transitions. [2020-02-10 20:01:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:12,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:12,722 INFO L225 Difference]: With dead ends: 88603 [2020-02-10 20:01:12,722 INFO L226 Difference]: Without dead ends: 88603 [2020-02-10 20:01:12,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88603 states. [2020-02-10 20:01:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88603 to 88603. [2020-02-10 20:01:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88603 states. [2020-02-10 20:01:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88603 states to 88603 states and 587879 transitions. [2020-02-10 20:01:19,169 INFO L78 Accepts]: Start accepts. Automaton has 88603 states and 587879 transitions. Word has length 34 [2020-02-10 20:01:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:19,170 INFO L479 AbstractCegarLoop]: Abstraction has 88603 states and 587879 transitions. [2020-02-10 20:01:19,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 88603 states and 587879 transitions. [2020-02-10 20:01:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:19,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:19,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:19,411 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2006703282, now seen corresponding path program 1 times [2020-02-10 20:01:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:19,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844607024] [2020-02-10 20:01:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:19,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844607024] [2020-02-10 20:01:19,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:19,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:19,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228017671] [2020-02-10 20:01:19,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:19,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:19,444 INFO L87 Difference]: Start difference. First operand 88603 states and 587879 transitions. Second operand 3 states. [2020-02-10 20:01:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:19,983 INFO L93 Difference]: Finished difference Result 76827 states and 490855 transitions. [2020-02-10 20:01:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:19,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:21,393 INFO L225 Difference]: With dead ends: 76827 [2020-02-10 20:01:21,393 INFO L226 Difference]: Without dead ends: 76827 [2020-02-10 20:01:21,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76827 states. [2020-02-10 20:01:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76827 to 76827. [2020-02-10 20:01:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76827 states. [2020-02-10 20:01:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76827 states to 76827 states and 490855 transitions. [2020-02-10 20:01:32,195 INFO L78 Accepts]: Start accepts. Automaton has 76827 states and 490855 transitions. Word has length 34 [2020-02-10 20:01:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:32,195 INFO L479 AbstractCegarLoop]: Abstraction has 76827 states and 490855 transitions. [2020-02-10 20:01:32,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:32,196 INFO L276 IsEmpty]: Start isEmpty. Operand 76827 states and 490855 transitions. [2020-02-10 20:01:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:32,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:32,385 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1312454640, now seen corresponding path program 1 times [2020-02-10 20:01:32,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:32,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925696654] [2020-02-10 20:01:32,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:32,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925696654] [2020-02-10 20:01:32,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:32,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:32,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302107899] [2020-02-10 20:01:32,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:32,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:32,419 INFO L87 Difference]: Start difference. First operand 76827 states and 490855 transitions. Second operand 3 states. [2020-02-10 20:01:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:32,755 INFO L93 Difference]: Finished difference Result 46747 states and 286439 transitions. [2020-02-10 20:01:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:32,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:32,911 INFO L225 Difference]: With dead ends: 46747 [2020-02-10 20:01:32,912 INFO L226 Difference]: Without dead ends: 46747 [2020-02-10 20:01:32,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46747 states. [2020-02-10 20:01:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46747 to 46747. [2020-02-10 20:01:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46747 states. [2020-02-10 20:01:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46747 states to 46747 states and 286439 transitions. [2020-02-10 20:01:41,720 INFO L78 Accepts]: Start accepts. Automaton has 46747 states and 286439 transitions. Word has length 34 [2020-02-10 20:01:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:41,721 INFO L479 AbstractCegarLoop]: Abstraction has 46747 states and 286439 transitions. [2020-02-10 20:01:41,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 46747 states and 286439 transitions. [2020-02-10 20:01:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:41,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:41,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:41,825 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1656741828, now seen corresponding path program 1 times [2020-02-10 20:01:41,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:41,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672481345] [2020-02-10 20:01:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:41,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672481345] [2020-02-10 20:01:41,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:41,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:41,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629201220] [2020-02-10 20:01:41,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:41,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:41,857 INFO L87 Difference]: Start difference. First operand 46747 states and 286439 transitions. Second operand 3 states. [2020-02-10 20:01:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:42,062 INFO L93 Difference]: Finished difference Result 28571 states and 167207 transitions. [2020-02-10 20:01:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:42,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:42,149 INFO L225 Difference]: With dead ends: 28571 [2020-02-10 20:01:42,149 INFO L226 Difference]: Without dead ends: 28571 [2020-02-10 20:01:42,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:43,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28571 states. [2020-02-10 20:01:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28571 to 28571. [2020-02-10 20:01:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28571 states. [2020-02-10 20:01:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28571 states to 28571 states and 167207 transitions. [2020-02-10 20:01:44,036 INFO L78 Accepts]: Start accepts. Automaton has 28571 states and 167207 transitions. Word has length 34 [2020-02-10 20:01:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:44,037 INFO L479 AbstractCegarLoop]: Abstraction has 28571 states and 167207 transitions. [2020-02-10 20:01:44,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28571 states and 167207 transitions. [2020-02-10 20:01:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:44,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:44,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:44,095 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 654666270, now seen corresponding path program 1 times [2020-02-10 20:01:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393929641] [2020-02-10 20:01:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:44,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393929641] [2020-02-10 20:01:44,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:44,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:44,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620905937] [2020-02-10 20:01:44,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:44,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:44,126 INFO L87 Difference]: Start difference. First operand 28571 states and 167207 transitions. Second operand 3 states. [2020-02-10 20:01:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:44,249 INFO L93 Difference]: Finished difference Result 18139 states and 100871 transitions. [2020-02-10 20:01:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:44,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:44,300 INFO L225 Difference]: With dead ends: 18139 [2020-02-10 20:01:44,300 INFO L226 Difference]: Without dead ends: 18139 [2020-02-10 20:01:44,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 20:01:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18139 states. [2020-02-10 20:01:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18139 to 18139. [2020-02-10 20:01:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18139 states. [2020-02-10 20:01:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18139 states to 18139 states and 100871 transitions. [2020-02-10 20:01:45,369 INFO L78 Accepts]: Start accepts. Automaton has 18139 states and 100871 transitions. Word has length 34 [2020-02-10 20:01:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:45,370 INFO L479 AbstractCegarLoop]: Abstraction has 18139 states and 100871 transitions. [2020-02-10 20:01:45,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18139 states and 100871 transitions. [2020-02-10 20:01:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:45,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:45,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:45,404 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1250911260, now seen corresponding path program 1 times [2020-02-10 20:01:45,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:45,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539265809] [2020-02-10 20:01:45,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:45,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539265809] [2020-02-10 20:01:45,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:45,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332394819] [2020-02-10 20:01:45,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:45,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:45,441 INFO L87 Difference]: Start difference. First operand 18139 states and 100871 transitions. Second operand 3 states. [2020-02-10 20:01:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:45,533 INFO L93 Difference]: Finished difference Result 10215 states and 56299 transitions. [2020-02-10 20:01:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:45,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:45,570 INFO L225 Difference]: With dead ends: 10215 [2020-02-10 20:01:45,570 INFO L226 Difference]: Without dead ends: 10215 [2020-02-10 20:01:45,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2020-02-10 20:01:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 10215. [2020-02-10 20:01:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10215 states. [2020-02-10 20:01:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 56299 transitions. [2020-02-10 20:01:46,582 INFO L78 Accepts]: Start accepts. Automaton has 10215 states and 56299 transitions. Word has length 34 [2020-02-10 20:01:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:46,582 INFO L479 AbstractCegarLoop]: Abstraction has 10215 states and 56299 transitions. [2020-02-10 20:01:46,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 10215 states and 56299 transitions. [2020-02-10 20:01:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:46,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:46,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:46,603 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -953380640, now seen corresponding path program 1 times [2020-02-10 20:01:46,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:46,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955547954] [2020-02-10 20:01:46,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:46,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955547954] [2020-02-10 20:01:46,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:46,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:01:46,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682882676] [2020-02-10 20:01:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:01:46,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:01:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:46,661 INFO L87 Difference]: Start difference. First operand 10215 states and 56299 transitions. Second operand 3 states. [2020-02-10 20:01:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:46,719 INFO L93 Difference]: Finished difference Result 6143 states and 33793 transitions. [2020-02-10 20:01:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:01:46,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:01:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:46,741 INFO L225 Difference]: With dead ends: 6143 [2020-02-10 20:01:46,741 INFO L226 Difference]: Without dead ends: 6143 [2020-02-10 20:01:46,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:01:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-02-10 20:01:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 6143. [2020-02-10 20:01:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2020-02-10 20:01:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 33793 transitions. [2020-02-10 20:01:47,278 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 33793 transitions. Word has length 34 [2020-02-10 20:01:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:47,278 INFO L479 AbstractCegarLoop]: Abstraction has 6143 states and 33793 transitions. [2020-02-10 20:01:47,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:01:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 33793 transitions. [2020-02-10 20:01:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:47,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:47,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:47,293 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1707014504, now seen corresponding path program 1 times [2020-02-10 20:01:47,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:47,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695156013] [2020-02-10 20:01:47,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:48,083 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 20:01:48,280 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:01:48,456 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:01:48,592 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:01:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:48,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695156013] [2020-02-10 20:01:48,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:48,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:48,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356330642] [2020-02-10 20:01:48,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:48,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:48,612 INFO L87 Difference]: Start difference. First operand 6143 states and 33793 transitions. Second operand 13 states. [2020-02-10 20:01:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:48,923 INFO L93 Difference]: Finished difference Result 11891 states and 58611 transitions. [2020-02-10 20:01:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:48,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:48,954 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:01:48,954 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:01:48,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:01:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:01:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6225. [2020-02-10 20:01:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:01:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34181 transitions. [2020-02-10 20:01:49,838 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34181 transitions. Word has length 34 [2020-02-10 20:01:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:49,838 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34181 transitions. [2020-02-10 20:01:49,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:01:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34181 transitions. [2020-02-10 20:01:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:49,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:49,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:49,854 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1070547650, now seen corresponding path program 2 times [2020-02-10 20:01:49,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:49,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443579585] [2020-02-10 20:01:49,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:50,604 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:01:50,766 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:01:50,936 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:01:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:50,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443579585] [2020-02-10 20:01:50,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:50,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:50,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725521303] [2020-02-10 20:01:50,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:50,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:50,950 INFO L87 Difference]: Start difference. First operand 6225 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:01:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:51,350 INFO L93 Difference]: Finished difference Result 11889 states and 58597 transitions. [2020-02-10 20:01:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:51,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:51,380 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:01:51,380 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:01:51,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:01:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:01:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6213. [2020-02-10 20:01:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:01:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34151 transitions. [2020-02-10 20:01:52,052 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34151 transitions. Word has length 34 [2020-02-10 20:01:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:52,052 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34151 transitions. [2020-02-10 20:01:52,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:01:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34151 transitions. [2020-02-10 20:01:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:52,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:52,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:52,064 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash -824698088, now seen corresponding path program 3 times [2020-02-10 20:01:52,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:52,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713497325] [2020-02-10 20:01:52,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:52,723 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:01:52,886 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:53,042 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:01:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:53,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713497325] [2020-02-10 20:01:53,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:53,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:53,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706720658] [2020-02-10 20:01:53,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:53,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:53,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:53,055 INFO L87 Difference]: Start difference. First operand 6213 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:01:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:53,446 INFO L93 Difference]: Finished difference Result 11879 states and 58577 transitions. [2020-02-10 20:01:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:53,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:53,487 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:01:53,487 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:01:53,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:01:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:01:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6221. [2020-02-10 20:01:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:01:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34166 transitions. [2020-02-10 20:01:54,340 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34166 transitions. Word has length 34 [2020-02-10 20:01:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:54,341 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34166 transitions. [2020-02-10 20:01:54,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:01:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34166 transitions. [2020-02-10 20:01:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:54,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:54,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:54,356 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1809634372, now seen corresponding path program 4 times [2020-02-10 20:01:54,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:54,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756062203] [2020-02-10 20:01:54,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:54,987 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:01:55,164 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:01:55,317 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:01:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:55,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756062203] [2020-02-10 20:01:55,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:55,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:55,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847138218] [2020-02-10 20:01:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:55,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:55,330 INFO L87 Difference]: Start difference. First operand 6221 states and 34166 transitions. Second operand 13 states. [2020-02-10 20:01:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:55,658 INFO L93 Difference]: Finished difference Result 11884 states and 58579 transitions. [2020-02-10 20:01:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:55,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:55,688 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:01:55,688 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:01:55,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:01:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:01:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6213. [2020-02-10 20:01:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:01:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34143 transitions. [2020-02-10 20:01:56,335 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34143 transitions. Word has length 34 [2020-02-10 20:01:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:56,335 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34143 transitions. [2020-02-10 20:01:56,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:01:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34143 transitions. [2020-02-10 20:01:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:56,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:56,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:56,347 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash 919665918, now seen corresponding path program 5 times [2020-02-10 20:01:56,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:56,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881663465] [2020-02-10 20:01:56,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:57,140 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:01:57,296 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:01:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:57,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881663465] [2020-02-10 20:01:57,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:57,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:57,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469804729] [2020-02-10 20:01:57,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:57,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:57,309 INFO L87 Difference]: Start difference. First operand 6213 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:01:57,873 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:01:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:57,898 INFO L93 Difference]: Finished difference Result 11876 states and 58564 transitions. [2020-02-10 20:01:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:57,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:57,930 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:01:57,930 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:01:57,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:01:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:01:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6220. [2020-02-10 20:01:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:01:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34156 transitions. [2020-02-10 20:01:58,576 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34156 transitions. Word has length 34 [2020-02-10 20:01:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:58,576 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34156 transitions. [2020-02-10 20:01:58,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:01:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34156 transitions. [2020-02-10 20:01:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:01:58,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01: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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:58,588 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 711203164, now seen corresponding path program 6 times [2020-02-10 20:01:58,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:58,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243664908] [2020-02-10 20:01:58,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:59,209 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:01:59,382 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:01:59,547 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:01:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:59,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243664908] [2020-02-10 20:01:59,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:59,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:01:59,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254864471] [2020-02-10 20:01:59,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:01:59,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:59,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:01:59,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:59,564 INFO L87 Difference]: Start difference. First operand 6220 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:01:59,952 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:01:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:59,981 INFO L93 Difference]: Finished difference Result 11879 states and 58563 transitions. [2020-02-10 20:01:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:01:59,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:01:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:00,011 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:02:00,011 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:02:00,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:02:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6204. [2020-02-10 20:02:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:02:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34119 transitions. [2020-02-10 20:02:00,666 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34119 transitions. Word has length 34 [2020-02-10 20:02:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:00,666 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34119 transitions. [2020-02-10 20:02:00,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34119 transitions. [2020-02-10 20:02:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:00,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:00,678 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2028412534, now seen corresponding path program 7 times [2020-02-10 20:02:00,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:00,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751771240] [2020-02-10 20:02:00,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:01,332 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:01,506 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:02:01,661 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:01,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751771240] [2020-02-10 20:02:01,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:01,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:01,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317714011] [2020-02-10 20:02:01,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:01,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:01,675 INFO L87 Difference]: Start difference. First operand 6204 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:02:02,073 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-02-10 20:02:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:02,100 INFO L93 Difference]: Finished difference Result 11900 states and 58627 transitions. [2020-02-10 20:02:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:02,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:02,132 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:02:02,133 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:02:02,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:02:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6228. [2020-02-10 20:02:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:02:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 20:02:02,770 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 20:02:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:02,770 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 20:02:02,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 20:02:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:02,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:02,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:02,782 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:02,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1391945680, now seen corresponding path program 8 times [2020-02-10 20:02:02,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:02,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892659152] [2020-02-10 20:02:02,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:03,474 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:03,676 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:03,868 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:03,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892659152] [2020-02-10 20:02:03,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:03,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901389857] [2020-02-10 20:02:03,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:03,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:03,886 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:02:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:04,229 INFO L93 Difference]: Finished difference Result 11898 states and 58613 transitions. [2020-02-10 20:02:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:04,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:04,259 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 20:02:04,259 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 20:02:04,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 20:02:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6216. [2020-02-10 20:02:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:02:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34149 transitions. [2020-02-10 20:02:04,897 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34149 transitions. Word has length 34 [2020-02-10 20:02:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:04,898 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34149 transitions. [2020-02-10 20:02:04,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34149 transitions. [2020-02-10 20:02:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:04,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:04,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:04,909 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1338535332, now seen corresponding path program 9 times [2020-02-10 20:02:04,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:04,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153633626] [2020-02-10 20:02:04,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:05,495 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:05,679 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:02:05,827 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:05,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153633626] [2020-02-10 20:02:05,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:05,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:05,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299306773] [2020-02-10 20:02:05,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:05,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:05,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:05,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:05,838 INFO L87 Difference]: Start difference. First operand 6216 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:02:06,252 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-02-10 20:02:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:06,278 INFO L93 Difference]: Finished difference Result 11897 states and 58610 transitions. [2020-02-10 20:02:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:06,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:06,310 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:02:06,310 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:02:06,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:02:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6226. [2020-02-10 20:02:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:02:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34167 transitions. [2020-02-10 20:02:06,952 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34167 transitions. Word has length 34 [2020-02-10 20:02:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:06,952 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34167 transitions. [2020-02-10 20:02:06,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34167 transitions. [2020-02-10 20:02:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:06,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:06,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:06,963 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1259187020, now seen corresponding path program 10 times [2020-02-10 20:02:06,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:06,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085130043] [2020-02-10 20:02:06,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:07,858 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085130043] [2020-02-10 20:02:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:07,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509941543] [2020-02-10 20:02:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:07,872 INFO L87 Difference]: Start difference. First operand 6226 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:02:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:08,193 INFO L93 Difference]: Finished difference Result 11894 states and 58595 transitions. [2020-02-10 20:02:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:08,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:08,223 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:02:08,223 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:02:08,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:02:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6216. [2020-02-10 20:02:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:02:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34139 transitions. [2020-02-10 20:02:08,869 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34139 transitions. Word has length 34 [2020-02-10 20:02:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:08,869 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34139 transitions. [2020-02-10 20:02:08,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34139 transitions. [2020-02-10 20:02:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:08,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:08,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:08,882 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -230638180, now seen corresponding path program 11 times [2020-02-10 20:02:08,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:08,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798326207] [2020-02-10 20:02:08,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:09,481 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:09,628 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:09,797 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:09,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798326207] [2020-02-10 20:02:09,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:09,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:09,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892781654] [2020-02-10 20:02:09,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:09,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:09,811 INFO L87 Difference]: Start difference. First operand 6216 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:02:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:10,119 INFO L93 Difference]: Finished difference Result 11892 states and 58592 transitions. [2020-02-10 20:02:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:10,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:10,150 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 20:02:10,150 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 20:02:10,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 20:02:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6225. [2020-02-10 20:02:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:02:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34156 transitions. [2020-02-10 20:02:10,970 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34156 transitions. Word has length 34 [2020-02-10 20:02:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:10,970 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34156 transitions. [2020-02-10 20:02:10,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34156 transitions. [2020-02-10 20:02:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:10,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:10,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:10,982 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:10,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1291416270, now seen corresponding path program 12 times [2020-02-10 20:02:10,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:10,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041097292] [2020-02-10 20:02:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:11,468 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-02-10 20:02:11,598 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:11,749 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:02:11,900 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:02:11,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 20:02:11,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041097292] [2020-02-10 20:02:11,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:11,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:11,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351135229] [2020-02-10 20:02:11,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:11,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:11,914 INFO L87 Difference]: Start difference. First operand 6225 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:02:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:12,344 INFO L93 Difference]: Finished difference Result 11891 states and 58581 transitions. [2020-02-10 20:02:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:12,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:12,378 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:02:12,378 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:02:12,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:02:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6204. [2020-02-10 20:02:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:02:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34109 transitions. [2020-02-10 20:02:13,019 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34109 transitions. Word has length 34 [2020-02-10 20:02:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:13,019 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34109 transitions. [2020-02-10 20:02:13,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34109 transitions. [2020-02-10 20:02:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:13,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02: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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:13,031 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:13,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2120866830, now seen corresponding path program 13 times [2020-02-10 20:02:13,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:13,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884156737] [2020-02-10 20:02:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:13,620 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:02:13,766 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:13,914 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:13,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884156737] [2020-02-10 20:02:13,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:13,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:13,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120328611] [2020-02-10 20:02:13,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:13,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:13,927 INFO L87 Difference]: Start difference. First operand 6204 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:02:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:14,238 INFO L93 Difference]: Finished difference Result 11875 states and 58559 transitions. [2020-02-10 20:02:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:14,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:14,268 INFO L225 Difference]: With dead ends: 11875 [2020-02-10 20:02:14,269 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 20:02:14,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 20:02:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6220. [2020-02-10 20:02:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:02:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34154 transitions. [2020-02-10 20:02:15,082 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34154 transitions. Word has length 34 [2020-02-10 20:02:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:15,082 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34154 transitions. [2020-02-10 20:02:15,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34154 transitions. [2020-02-10 20:02:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:15,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:15,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:15,094 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1189164182, now seen corresponding path program 14 times [2020-02-10 20:02:15,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:15,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831038139] [2020-02-10 20:02:15,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:15,663 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:02:15,843 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:02:15,995 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:16,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831038139] [2020-02-10 20:02:16,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:16,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:16,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446727185] [2020-02-10 20:02:16,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:16,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:16,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:16,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:16,008 INFO L87 Difference]: Start difference. First operand 6220 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:02:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:16,311 INFO L93 Difference]: Finished difference Result 11880 states and 58561 transitions. [2020-02-10 20:02:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:16,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:16,341 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:02:16,341 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:02:16,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:02:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6212. [2020-02-10 20:02:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:02:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34131 transitions. [2020-02-10 20:02:16,983 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34131 transitions. Word has length 34 [2020-02-10 20:02:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:16,983 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34131 transitions. [2020-02-10 20:02:16,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34131 transitions. [2020-02-10 20:02:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:16,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:16,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:16,994 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1099114754, now seen corresponding path program 15 times [2020-02-10 20:02:16,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:16,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093916919] [2020-02-10 20:02:16,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:17,521 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-02-10 20:02:17,673 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2020-02-10 20:02:17,813 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:17,958 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:17,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093916919] [2020-02-10 20:02:17,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:17,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:17,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258482773] [2020-02-10 20:02:17,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:17,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:17,973 INFO L87 Difference]: Start difference. First operand 6212 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:02:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:18,362 INFO L93 Difference]: Finished difference Result 11871 states and 58544 transitions. [2020-02-10 20:02:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:18,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:18,393 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:02:18,394 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:02:18,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:02:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 20:02:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:02:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34144 transitions. [2020-02-10 20:02:19,223 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34144 transitions. Word has length 34 [2020-02-10 20:02:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:19,224 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34144 transitions. [2020-02-10 20:02:19,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34144 transitions. [2020-02-10 20:02:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:19,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:19,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:19,235 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1779692234, now seen corresponding path program 16 times [2020-02-10 20:02:19,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:19,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086366845] [2020-02-10 20:02:19,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:19,948 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:02:20,096 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:20,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086366845] [2020-02-10 20:02:20,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:20,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:20,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577063080] [2020-02-10 20:02:20,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:20,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:20,109 INFO L87 Difference]: Start difference. First operand 6219 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:02:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:20,469 INFO L93 Difference]: Finished difference Result 11873 states and 58541 transitions. [2020-02-10 20:02:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:20,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:20,499 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:02:20,499 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:02:20,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:02:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6212. [2020-02-10 20:02:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:02:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34124 transitions. [2020-02-10 20:02:21,138 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34124 transitions. Word has length 34 [2020-02-10 20:02:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:21,138 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34124 transitions. [2020-02-10 20:02:21,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34124 transitions. [2020-02-10 20:02:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:21,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:21,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:21,150 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:21,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2140460770, now seen corresponding path program 17 times [2020-02-10 20:02:21,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:21,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956361825] [2020-02-10 20:02:21,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:21,732 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:21,876 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:02:22,032 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:22,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956361825] [2020-02-10 20:02:22,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:22,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:22,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142802409] [2020-02-10 20:02:22,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:22,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:22,046 INFO L87 Difference]: Start difference. First operand 6212 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:02:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:22,403 INFO L93 Difference]: Finished difference Result 11884 states and 58563 transitions. [2020-02-10 20:02:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:22,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:22,433 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:02:22,433 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:02:22,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:02:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6222. [2020-02-10 20:02:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:02:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34142 transitions. [2020-02-10 20:02:23,273 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34142 transitions. Word has length 34 [2020-02-10 20:02:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:23,273 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34142 transitions. [2020-02-10 20:02:23,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34142 transitions. [2020-02-10 20:02:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:23,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:23,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:23,284 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash 887244786, now seen corresponding path program 18 times [2020-02-10 20:02:23,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:23,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886314825] [2020-02-10 20:02:23,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:23,828 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:23,975 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:02:24,124 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:02:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:24,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886314825] [2020-02-10 20:02:24,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:24,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:24,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135827215] [2020-02-10 20:02:24,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:24,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:24,138 INFO L87 Difference]: Start difference. First operand 6222 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:02:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:24,473 INFO L93 Difference]: Finished difference Result 11881 states and 58548 transitions. [2020-02-10 20:02:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:24,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:24,503 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 20:02:24,503 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:02:24,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:02:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 20:02:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:02:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34101 transitions. [2020-02-10 20:02:25,161 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34101 transitions. Word has length 34 [2020-02-10 20:02:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:25,162 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34101 transitions. [2020-02-10 20:02:25,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34101 transitions. [2020-02-10 20:02:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:25,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:25,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:25,175 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2135793486, now seen corresponding path program 19 times [2020-02-10 20:02:25,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:25,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040996249] [2020-02-10 20:02:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:25,899 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:02:26,051 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:26,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040996249] [2020-02-10 20:02:26,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:26,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:26,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63355455] [2020-02-10 20:02:26,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:26,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:26,065 INFO L87 Difference]: Start difference. First operand 6204 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:02:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:26,383 INFO L93 Difference]: Finished difference Result 11867 states and 58536 transitions. [2020-02-10 20:02:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:26,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:26,413 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 20:02:26,413 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:02:26,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:02:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6218. [2020-02-10 20:02:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:02:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34141 transitions. [2020-02-10 20:02:27,050 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34141 transitions. Word has length 34 [2020-02-10 20:02:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:27,050 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34141 transitions. [2020-02-10 20:02:27,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34141 transitions. [2020-02-10 20:02:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:27,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:27,062 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:27,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1950711056, now seen corresponding path program 20 times [2020-02-10 20:02:27,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:27,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446536704] [2020-02-10 20:02:27,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:27,612 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:02:27,969 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:28,120 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:28,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446536704] [2020-02-10 20:02:28,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716245697] [2020-02-10 20:02:28,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:28,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:28,132 INFO L87 Difference]: Start difference. First operand 6218 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:02:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:28,498 INFO L93 Difference]: Finished difference Result 11870 states and 58535 transitions. [2020-02-10 20:02:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:28,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:28,535 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:02:28,536 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:02:28,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:02:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6211. [2020-02-10 20:02:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:02:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34121 transitions. [2020-02-10 20:02:29,177 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34121 transitions. Word has length 34 [2020-02-10 20:02:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:29,177 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34121 transitions. [2020-02-10 20:02:29,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34121 transitions. [2020-02-10 20:02:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:29,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:29,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:29,188 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -660175908, now seen corresponding path program 21 times [2020-02-10 20:02:29,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:29,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357069152] [2020-02-10 20:02:29,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:29,963 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:02:30,117 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:02:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:30,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357069152] [2020-02-10 20:02:30,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:30,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:30,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739076428] [2020-02-10 20:02:30,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:30,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:30,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:30,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:30,129 INFO L87 Difference]: Start difference. First operand 6211 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:02:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:30,472 INFO L93 Difference]: Finished difference Result 11866 states and 58527 transitions. [2020-02-10 20:02:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:30,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:30,503 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:02:30,503 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 20:02:30,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 20:02:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6218. [2020-02-10 20:02:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:02:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34134 transitions. [2020-02-10 20:02:31,144 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34134 transitions. Word has length 34 [2020-02-10 20:02:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:31,144 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34134 transitions. [2020-02-10 20:02:31,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34134 transitions. [2020-02-10 20:02:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:31,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:31,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:31,156 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash 755984400, now seen corresponding path program 22 times [2020-02-10 20:02:31,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:31,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574388845] [2020-02-10 20:02:31,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:31,844 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:02:32,180 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:02:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:32,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574388845] [2020-02-10 20:02:32,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:32,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:32,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024164260] [2020-02-10 20:02:32,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:32,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:32,193 INFO L87 Difference]: Start difference. First operand 6218 states and 34134 transitions. Second operand 13 states. [2020-02-10 20:02:32,609 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-02-10 20:02:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:32,640 INFO L93 Difference]: Finished difference Result 11868 states and 58524 transitions. [2020-02-10 20:02:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:32,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:32,670 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 20:02:32,671 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 20:02:32,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 20:02:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6211. [2020-02-10 20:02:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:02:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34114 transitions. [2020-02-10 20:02:33,308 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34114 transitions. Word has length 34 [2020-02-10 20:02:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:33,308 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34114 transitions. [2020-02-10 20:02:33,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34114 transitions. [2020-02-10 20:02:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:33,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:33,320 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1392959652, now seen corresponding path program 23 times [2020-02-10 20:02:33,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:33,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230212184] [2020-02-10 20:02:33,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:33,965 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:34,111 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:34,258 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:34,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230212184] [2020-02-10 20:02:34,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:34,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:34,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384134901] [2020-02-10 20:02:34,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:34,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:34,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:34,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:34,270 INFO L87 Difference]: Start difference. First operand 6211 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:02:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:34,657 INFO L93 Difference]: Finished difference Result 11874 states and 58538 transitions. [2020-02-10 20:02:34,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:34,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:34,688 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:02:34,688 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:02:34,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:02:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6220. [2020-02-10 20:02:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:02:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34131 transitions. [2020-02-10 20:02:35,330 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34131 transitions. Word has length 34 [2020-02-10 20:02:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:35,330 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34131 transitions. [2020-02-10 20:02:35,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34131 transitions. [2020-02-10 20:02:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:35,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:35,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:35,342 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1411393678, now seen corresponding path program 24 times [2020-02-10 20:02:35,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:35,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288431907] [2020-02-10 20:02:35,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:35,908 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:36,055 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:02:36,205 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:02:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:36,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288431907] [2020-02-10 20:02:36,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:36,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:36,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791763287] [2020-02-10 20:02:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:36,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:36,218 INFO L87 Difference]: Start difference. First operand 6220 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:02:36,708 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-02-10 20:02:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:36,739 INFO L93 Difference]: Finished difference Result 11873 states and 58527 transitions. [2020-02-10 20:02:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:36,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:36,771 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:02:36,771 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:02:36,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:02:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6194. [2020-02-10 20:02:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:02:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34076 transitions. [2020-02-10 20:02:37,403 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34076 transitions. Word has length 34 [2020-02-10 20:02:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:37,404 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34076 transitions. [2020-02-10 20:02:37,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34076 transitions. [2020-02-10 20:02:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:37,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:37,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:37,415 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1529260104, now seen corresponding path program 25 times [2020-02-10 20:02:37,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:37,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674374299] [2020-02-10 20:02:37,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:37,993 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:38,140 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:02:38,290 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:38,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674374299] [2020-02-10 20:02:38,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:38,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:38,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470596554] [2020-02-10 20:02:38,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:38,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:38,302 INFO L87 Difference]: Start difference. First operand 6194 states and 34076 transitions. Second operand 13 states. [2020-02-10 20:02:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:38,649 INFO L93 Difference]: Finished difference Result 11873 states and 58547 transitions. [2020-02-10 20:02:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:38,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:38,678 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:02:38,678 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:02:38,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:02:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6223. [2020-02-10 20:02:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:02:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34165 transitions. [2020-02-10 20:02:39,322 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34165 transitions. Word has length 34 [2020-02-10 20:02:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:39,322 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34165 transitions. [2020-02-10 20:02:39,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34165 transitions. [2020-02-10 20:02:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:39,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:39,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:39,333 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2129240338, now seen corresponding path program 26 times [2020-02-10 20:02:39,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:39,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184927340] [2020-02-10 20:02:39,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:39,883 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:40,031 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:40,197 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:40,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184927340] [2020-02-10 20:02:40,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:40,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:40,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143455546] [2020-02-10 20:02:40,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:40,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:40,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:40,209 INFO L87 Difference]: Start difference. First operand 6223 states and 34165 transitions. Second operand 13 states. [2020-02-10 20:02:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:40,722 INFO L93 Difference]: Finished difference Result 11871 states and 58533 transitions. [2020-02-10 20:02:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:40,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:40,764 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:02:40,765 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:02:40,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:02:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6211. [2020-02-10 20:02:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:02:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34135 transitions. [2020-02-10 20:02:41,601 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34135 transitions. Word has length 34 [2020-02-10 20:02:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:41,601 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34135 transitions. [2020-02-10 20:02:41,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34135 transitions. [2020-02-10 20:02:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:41,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:41,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:41,613 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 233994600, now seen corresponding path program 27 times [2020-02-10 20:02:41,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:41,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777518181] [2020-02-10 20:02:41,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:42,177 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:02:42,317 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:42,461 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:42,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777518181] [2020-02-10 20:02:42,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:42,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:42,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472166278] [2020-02-10 20:02:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:42,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:42,477 INFO L87 Difference]: Start difference. First operand 6211 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:02:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:42,964 INFO L93 Difference]: Finished difference Result 11861 states and 58513 transitions. [2020-02-10 20:02:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:42,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:43,002 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:02:43,003 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:02:43,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:02:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6219. [2020-02-10 20:02:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:02:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34150 transitions. [2020-02-10 20:02:43,645 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34150 transitions. Word has length 34 [2020-02-10 20:02:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:43,645 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34150 transitions. [2020-02-10 20:02:43,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34150 transitions. [2020-02-10 20:02:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:43,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:43,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:43,656 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -750941684, now seen corresponding path program 28 times [2020-02-10 20:02:43,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:43,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371541551] [2020-02-10 20:02:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:44,225 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:02:44,377 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:02:44,524 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:44,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371541551] [2020-02-10 20:02:44,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:44,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:44,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649307414] [2020-02-10 20:02:44,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:44,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:44,535 INFO L87 Difference]: Start difference. First operand 6219 states and 34150 transitions. Second operand 13 states. [2020-02-10 20:02:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:44,887 INFO L93 Difference]: Finished difference Result 11866 states and 58515 transitions. [2020-02-10 20:02:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:44,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:44,917 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:02:44,917 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:02:44,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:02:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6211. [2020-02-10 20:02:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:02:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34127 transitions. [2020-02-10 20:02:45,782 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34127 transitions. Word has length 34 [2020-02-10 20:02:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:45,783 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34127 transitions. [2020-02-10 20:02:45,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34127 transitions. [2020-02-10 20:02:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:45,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:45,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:45,795 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1978358606, now seen corresponding path program 29 times [2020-02-10 20:02:45,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:45,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077331960] [2020-02-10 20:02:45,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:46,501 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:02:46,650 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:46,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077331960] [2020-02-10 20:02:46,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:46,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:46,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582716552] [2020-02-10 20:02:46,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:46,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:46,662 INFO L87 Difference]: Start difference. First operand 6211 states and 34127 transitions. Second operand 13 states. [2020-02-10 20:02:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:46,964 INFO L93 Difference]: Finished difference Result 11858 states and 58500 transitions. [2020-02-10 20:02:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:46,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:46,995 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 20:02:46,995 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:02:46,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:02:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6218. [2020-02-10 20:02:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:02:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34140 transitions. [2020-02-10 20:02:47,646 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34140 transitions. Word has length 34 [2020-02-10 20:02:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:47,647 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34140 transitions. [2020-02-10 20:02:47,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34140 transitions. [2020-02-10 20:02:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:47,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:47,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:47,658 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1769895852, now seen corresponding path program 30 times [2020-02-10 20:02:47,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:47,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424320045] [2020-02-10 20:02:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:48,360 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:48,508 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:48,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424320045] [2020-02-10 20:02:48,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:48,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:48,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871990755] [2020-02-10 20:02:48,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:48,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:48,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:48,520 INFO L87 Difference]: Start difference. First operand 6218 states and 34140 transitions. Second operand 13 states. [2020-02-10 20:02:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:48,823 INFO L93 Difference]: Finished difference Result 11861 states and 58499 transitions. [2020-02-10 20:02:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:48,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:48,853 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:02:48,853 INFO L226 Difference]: Without dead ends: 11823 [2020-02-10 20:02:48,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2020-02-10 20:02:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 6202. [2020-02-10 20:02:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:02:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34104 transitions. [2020-02-10 20:02:49,494 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34104 transitions. Word has length 34 [2020-02-10 20:02:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:49,494 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34104 transitions. [2020-02-10 20:02:49,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34104 transitions. [2020-02-10 20:02:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:49,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:49,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:49,509 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1935056908, now seen corresponding path program 31 times [2020-02-10 20:02:49,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:49,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146664500] [2020-02-10 20:02:49,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:50,075 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:50,324 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:02:50,472 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:50,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146664500] [2020-02-10 20:02:50,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:50,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:50,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790663664] [2020-02-10 20:02:50,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:50,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:50,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:50,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:50,485 INFO L87 Difference]: Start difference. First operand 6202 states and 34104 transitions. Second operand 13 states. [2020-02-10 20:02:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:50,765 INFO L93 Difference]: Finished difference Result 11869 states and 58527 transitions. [2020-02-10 20:02:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:50,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:50,795 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:02:50,795 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:02:50,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:02:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6222. [2020-02-10 20:02:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:02:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34153 transitions. [2020-02-10 20:02:51,437 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34153 transitions. Word has length 34 [2020-02-10 20:02:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:51,437 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34153 transitions. [2020-02-10 20:02:51,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34153 transitions. [2020-02-10 20:02:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:51,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:51,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:51,449 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1723443534, now seen corresponding path program 32 times [2020-02-10 20:02:51,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:51,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355868392] [2020-02-10 20:02:51,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:52,016 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:02:52,161 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:52,316 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:52,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355868392] [2020-02-10 20:02:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:52,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061904732] [2020-02-10 20:02:52,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:52,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:52,328 INFO L87 Difference]: Start difference. First operand 6222 states and 34153 transitions. Second operand 13 states. [2020-02-10 20:02:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:52,638 INFO L93 Difference]: Finished difference Result 11867 states and 58513 transitions. [2020-02-10 20:02:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:52,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:52,668 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 20:02:52,668 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:02:52,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:02:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6210. [2020-02-10 20:02:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:02:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34124 transitions. [2020-02-10 20:02:53,307 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34124 transitions. Word has length 34 [2020-02-10 20:02:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:53,307 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34124 transitions. [2020-02-10 20:02:53,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34124 transitions. [2020-02-10 20:02:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:53,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:53,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:53,319 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1134213844, now seen corresponding path program 33 times [2020-02-10 20:02:53,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:53,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414303306] [2020-02-10 20:02:53,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:54,026 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:02:54,175 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:54,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414303306] [2020-02-10 20:02:54,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:54,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:54,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897097735] [2020-02-10 20:02:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:54,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:54,187 INFO L87 Difference]: Start difference. First operand 6210 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:02:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:54,439 INFO L93 Difference]: Finished difference Result 11860 states and 58498 transitions. [2020-02-10 20:02:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:54,440 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:54,469 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:02:54,469 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 20:02:54,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 20:02:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6217. [2020-02-10 20:02:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:02:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34136 transitions. [2020-02-10 20:02:55,184 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34136 transitions. Word has length 34 [2020-02-10 20:02:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:55,185 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34136 transitions. [2020-02-10 20:02:55,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34136 transitions. [2020-02-10 20:02:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:55,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:55,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:55,196 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1346369462, now seen corresponding path program 34 times [2020-02-10 20:02:55,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:55,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118256355] [2020-02-10 20:02:55,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:55,894 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:56,040 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:02:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:56,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118256355] [2020-02-10 20:02:56,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:56,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:56,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469659184] [2020-02-10 20:02:56,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:56,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:56,052 INFO L87 Difference]: Start difference. First operand 6217 states and 34136 transitions. Second operand 13 states. [2020-02-10 20:02:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:56,352 INFO L93 Difference]: Finished difference Result 11854 states and 58480 transitions. [2020-02-10 20:02:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:56,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:56,382 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:02:56,383 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:02:56,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:02:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 20:02:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:02:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34117 transitions. [2020-02-10 20:02:57,020 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34117 transitions. Word has length 34 [2020-02-10 20:02:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:57,020 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34117 transitions. [2020-02-10 20:02:57,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34117 transitions. [2020-02-10 20:02:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:57,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:57,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:57,032 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash 397994544, now seen corresponding path program 35 times [2020-02-10 20:02:57,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:57,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201080575] [2020-02-10 20:02:57,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:57,721 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:02:57,875 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:57,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201080575] [2020-02-10 20:02:57,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:57,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:57,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376175207] [2020-02-10 20:02:57,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:57,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:57,888 INFO L87 Difference]: Start difference. First operand 6210 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:02:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:58,186 INFO L93 Difference]: Finished difference Result 11851 states and 58475 transitions. [2020-02-10 20:02:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:02:58,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:02:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:58,216 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:02:58,216 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:02:58,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:02:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:02:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6216. [2020-02-10 20:02:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:02:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34128 transitions. [2020-02-10 20:02:58,859 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34128 transitions. Word has length 34 [2020-02-10 20:02:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:58,859 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34128 transitions. [2020-02-10 20:02:58,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:02:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34128 transitions. [2020-02-10 20:02:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:02:58,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:58,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:58,972 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash -26316692, now seen corresponding path program 36 times [2020-02-10 20:02:58,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:58,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542224166] [2020-02-10 20:02:58,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:59,655 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:02:59,800 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:02:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:59,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542224166] [2020-02-10 20:02:59,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:59,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:02:59,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104209074] [2020-02-10 20:02:59,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:02:59,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:02:59,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:59,813 INFO L87 Difference]: Start difference. First operand 6216 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:03:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:00,119 INFO L93 Difference]: Finished difference Result 11855 states and 58477 transitions. [2020-02-10 20:03:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:00,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:00,150 INFO L225 Difference]: With dead ends: 11855 [2020-02-10 20:03:00,150 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:03:00,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:03:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6202. [2020-02-10 20:03:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:03:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34096 transitions. [2020-02-10 20:03:00,787 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34096 transitions. Word has length 34 [2020-02-10 20:03:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:00,787 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34096 transitions. [2020-02-10 20:03:00,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34096 transitions. [2020-02-10 20:03:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:00,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:00,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:00,798 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash -709674192, now seen corresponding path program 37 times [2020-02-10 20:03:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:00,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479382468] [2020-02-10 20:03:00,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:01,360 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:03:01,503 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:03:01,655 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:01,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479382468] [2020-02-10 20:03:01,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:01,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:01,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832336127] [2020-02-10 20:03:01,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:01,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:01,668 INFO L87 Difference]: Start difference. First operand 6202 states and 34096 transitions. Second operand 13 states. [2020-02-10 20:03:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:01,996 INFO L93 Difference]: Finished difference Result 11849 states and 58476 transitions. [2020-02-10 20:03:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:01,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:02,025 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 20:03:02,025 INFO L226 Difference]: Without dead ends: 11830 [2020-02-10 20:03:02,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11830 states. [2020-02-10 20:03:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11830 to 6217. [2020-02-10 20:03:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:03:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34137 transitions. [2020-02-10 20:03:02,677 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34137 transitions. Word has length 34 [2020-02-10 20:03:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:02,677 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34137 transitions. [2020-02-10 20:03:02,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34137 transitions. [2020-02-10 20:03:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:02,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:02,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:02,691 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1694610476, now seen corresponding path program 38 times [2020-02-10 20:03:02,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:02,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274094038] [2020-02-10 20:03:02,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:03,269 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:03:03,415 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:03:03,567 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:03,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274094038] [2020-02-10 20:03:03,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:03,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:03,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380414902] [2020-02-10 20:03:03,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:03,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:03,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:03,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:03,578 INFO L87 Difference]: Start difference. First operand 6217 states and 34137 transitions. Second operand 13 states. [2020-02-10 20:03:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:03,995 INFO L93 Difference]: Finished difference Result 11854 states and 58478 transitions. [2020-02-10 20:03:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:03,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:04,025 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:03:04,026 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:03:04,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:03:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6209. [2020-02-10 20:03:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:03:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34115 transitions. [2020-02-10 20:03:04,668 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34115 transitions. Word has length 34 [2020-02-10 20:03:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:04,668 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34115 transitions. [2020-02-10 20:03:04,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34115 transitions. [2020-02-10 20:03:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:04,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:04,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:04,680 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1303436242, now seen corresponding path program 39 times [2020-02-10 20:03:04,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:04,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576911477] [2020-02-10 20:03:04,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:05,383 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:03:05,529 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:05,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576911477] [2020-02-10 20:03:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:05,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118335773] [2020-02-10 20:03:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:05,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:05,542 INFO L87 Difference]: Start difference. First operand 6209 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:03:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:06,013 INFO L93 Difference]: Finished difference Result 11841 states and 58453 transitions. [2020-02-10 20:03:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:06,014 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:06,042 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:03:06,043 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:03:06,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:03:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:03:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:03:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34126 transitions. [2020-02-10 20:03:06,683 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34126 transitions. Word has length 34 [2020-02-10 20:03:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:06,684 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34126 transitions. [2020-02-10 20:03:06,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34126 transitions. [2020-02-10 20:03:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:06,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:06,695 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1912086904, now seen corresponding path program 40 times [2020-02-10 20:03:06,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:06,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789991029] [2020-02-10 20:03:06,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:07,225 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:03:07,367 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:03:07,518 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:07,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789991029] [2020-02-10 20:03:07,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:07,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:07,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167192061] [2020-02-10 20:03:07,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:07,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:07,530 INFO L87 Difference]: Start difference. First operand 6215 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:03:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:07,858 INFO L93 Difference]: Finished difference Result 11840 states and 58445 transitions. [2020-02-10 20:03:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:07,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:07,890 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:03:07,890 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:03:07,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:03:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6209. [2020-02-10 20:03:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:03:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34109 transitions. [2020-02-10 20:03:08,614 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34109 transitions. Word has length 34 [2020-02-10 20:03:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:08,614 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34109 transitions. [2020-02-10 20:03:08,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34109 transitions. [2020-02-10 20:03:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:08,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:08,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:08,625 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash -6309138, now seen corresponding path program 41 times [2020-02-10 20:03:08,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:08,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920479006] [2020-02-10 20:03:08,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:09,338 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:03:09,487 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:09,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920479006] [2020-02-10 20:03:09,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:09,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:09,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740064380] [2020-02-10 20:03:09,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:09,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:09,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:09,499 INFO L87 Difference]: Start difference. First operand 6209 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:03:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:09,772 INFO L93 Difference]: Finished difference Result 11852 states and 58467 transitions. [2020-02-10 20:03:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:09,772 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:09,802 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 20:03:09,802 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:03:09,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:03:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 20:03:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:03:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34121 transitions. [2020-02-10 20:03:10,441 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34121 transitions. Word has length 34 [2020-02-10 20:03:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:10,441 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34121 transitions. [2020-02-10 20:03:10,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34121 transitions. [2020-02-10 20:03:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:10,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:10,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:10,453 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 267269468, now seen corresponding path program 42 times [2020-02-10 20:03:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:10,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660805053] [2020-02-10 20:03:10,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:11,136 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:03:11,286 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:11,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660805053] [2020-02-10 20:03:11,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:11,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:11,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030473535] [2020-02-10 20:03:11,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:11,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:11,297 INFO L87 Difference]: Start difference. First operand 6216 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:03:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:11,627 INFO L93 Difference]: Finished difference Result 11846 states and 58449 transitions. [2020-02-10 20:03:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:11,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:11,660 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:03:11,661 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:03:11,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:03:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6202. [2020-02-10 20:03:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:03:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34089 transitions. [2020-02-10 20:03:12,299 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34089 transitions. Word has length 34 [2020-02-10 20:03:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:12,299 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34089 transitions. [2020-02-10 20:03:12,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34089 transitions. [2020-02-10 20:03:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:12,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:12,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:12,310 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash -455854420, now seen corresponding path program 43 times [2020-02-10 20:03:12,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:12,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377079932] [2020-02-10 20:03:12,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:12,884 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:03:13,123 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:13,274 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:13,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377079932] [2020-02-10 20:03:13,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:13,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:13,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892042292] [2020-02-10 20:03:13,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:13,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:13,288 INFO L87 Difference]: Start difference. First operand 6202 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:03:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:13,647 INFO L93 Difference]: Finished difference Result 11836 states and 58443 transitions. [2020-02-10 20:03:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:13,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:13,678 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 20:03:13,678 INFO L226 Difference]: Without dead ends: 11817 [2020-02-10 20:03:13,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2020-02-10 20:03:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 6214. [2020-02-10 20:03:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:03:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34123 transitions. [2020-02-10 20:03:14,316 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34123 transitions. Word has length 34 [2020-02-10 20:03:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:14,316 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34123 transitions. [2020-02-10 20:03:14,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34123 transitions. [2020-02-10 20:03:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:14,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:14,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:14,328 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash 152796242, now seen corresponding path program 44 times [2020-02-10 20:03:14,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:14,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564219028] [2020-02-10 20:03:14,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:15,036 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:15,186 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:15,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564219028] [2020-02-10 20:03:15,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:15,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:15,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305061335] [2020-02-10 20:03:15,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:15,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:15,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:15,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:15,198 INFO L87 Difference]: Start difference. First operand 6214 states and 34123 transitions. Second operand 13 states. [2020-02-10 20:03:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:15,532 INFO L93 Difference]: Finished difference Result 11835 states and 58435 transitions. [2020-02-10 20:03:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:15,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:15,562 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:03:15,562 INFO L226 Difference]: Without dead ends: 11811 [2020-02-10 20:03:15,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2020-02-10 20:03:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 6208. [2020-02-10 20:03:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:03:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34106 transitions. [2020-02-10 20:03:16,197 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34106 transitions. Word has length 34 [2020-02-10 20:03:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:16,197 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34106 transitions. [2020-02-10 20:03:16,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34106 transitions. [2020-02-10 20:03:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:16,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:16,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:16,208 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -724600848, now seen corresponding path program 45 times [2020-02-10 20:03:16,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:16,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720119084] [2020-02-10 20:03:16,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:16,883 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:17,034 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:17,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720119084] [2020-02-10 20:03:17,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:17,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:17,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663646488] [2020-02-10 20:03:17,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:17,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:17,047 INFO L87 Difference]: Start difference. First operand 6208 states and 34106 transitions. Second operand 13 states. [2020-02-10 20:03:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:17,397 INFO L93 Difference]: Finished difference Result 11841 states and 58448 transitions. [2020-02-10 20:03:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:17,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:17,427 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:03:17,427 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:03:17,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:03:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:03:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:03:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34119 transitions. [2020-02-10 20:03:18,138 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34119 transitions. Word has length 34 [2020-02-10 20:03:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:18,139 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34119 transitions. [2020-02-10 20:03:18,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34119 transitions. [2020-02-10 20:03:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:18,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:18,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:18,150 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -933063602, now seen corresponding path program 46 times [2020-02-10 20:03:18,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522995387] [2020-02-10 20:03:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:18,833 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:18,981 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:18,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522995387] [2020-02-10 20:03:18,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:18,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:18,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297925344] [2020-02-10 20:03:18,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:18,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:18,993 INFO L87 Difference]: Start difference. First operand 6215 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:03:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:19,430 INFO L93 Difference]: Finished difference Result 11844 states and 58447 transitions. [2020-02-10 20:03:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:19,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:19,459 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 20:03:19,459 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:03:19,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:03:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6208. [2020-02-10 20:03:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:03:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34100 transitions. [2020-02-10 20:03:20,100 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34100 transitions. Word has length 34 [2020-02-10 20:03:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:20,100 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34100 transitions. [2020-02-10 20:03:20,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34100 transitions. [2020-02-10 20:03:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:20,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:20,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:20,112 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash -136936970, now seen corresponding path program 47 times [2020-02-10 20:03:20,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:20,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662733754] [2020-02-10 20:03:20,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:20,783 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:20,932 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03: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 20:03:20,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662733754] [2020-02-10 20:03:20,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:20,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407585586] [2020-02-10 20:03:20,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:20,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:20,945 INFO L87 Difference]: Start difference. First operand 6208 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:03:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:21,270 INFO L93 Difference]: Finished difference Result 11838 states and 58435 transitions. [2020-02-10 20:03:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:21,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:21,300 INFO L225 Difference]: With dead ends: 11838 [2020-02-10 20:03:21,300 INFO L226 Difference]: Without dead ends: 11820 [2020-02-10 20:03:21,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11820 states. [2020-02-10 20:03:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11820 to 6214. [2020-02-10 20:03:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:03:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34111 transitions. [2020-02-10 20:03:21,938 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34111 transitions. Word has length 34 [2020-02-10 20:03:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:21,938 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34111 transitions. [2020-02-10 20:03:21,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34111 transitions. [2020-02-10 20:03:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:21,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:21,950 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash 755237736, now seen corresponding path program 48 times [2020-02-10 20:03:21,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:21,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623864987] [2020-02-10 20:03:21,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:22,382 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 20:03:22,730 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:22,879 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:22,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623864987] [2020-02-10 20:03:22,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:22,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:22,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235393948] [2020-02-10 20:03:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:22,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:22,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:22,891 INFO L87 Difference]: Start difference. First operand 6214 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:03:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:23,376 INFO L93 Difference]: Finished difference Result 11842 states and 58437 transitions. [2020-02-10 20:03:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:23,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:23,407 INFO L225 Difference]: With dead ends: 11842 [2020-02-10 20:03:23,407 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:03:23,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:03:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6194. [2020-02-10 20:03:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:03:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34068 transitions. [2020-02-10 20:03:24,044 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34068 transitions. Word has length 34 [2020-02-10 20:03:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:24,044 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34068 transitions. [2020-02-10 20:03:24,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34068 transitions. [2020-02-10 20:03:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:24,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:24,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:24,055 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash -561652570, now seen corresponding path program 49 times [2020-02-10 20:03:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:24,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541954458] [2020-02-10 20:03:24,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:24,608 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:24,761 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:03:24,908 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:24,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541954458] [2020-02-10 20:03:24,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:24,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:24,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637170658] [2020-02-10 20:03:24,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:24,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:24,920 INFO L87 Difference]: Start difference. First operand 6194 states and 34068 transitions. Second operand 13 states. [2020-02-10 20:03:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:25,357 INFO L93 Difference]: Finished difference Result 11879 states and 58554 transitions. [2020-02-10 20:03:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:25,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:25,386 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:03:25,386 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:03:25,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:03:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6223. [2020-02-10 20:03:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:03:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34155 transitions. [2020-02-10 20:03:26,025 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34155 transitions. Word has length 34 [2020-02-10 20:03:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:26,026 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34155 transitions. [2020-02-10 20:03:26,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34155 transitions. [2020-02-10 20:03:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:26,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:26,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:26,037 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1198119424, now seen corresponding path program 50 times [2020-02-10 20:03:26,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:26,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832792525] [2020-02-10 20:03:26,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:26,581 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:26,724 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:26,877 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:26,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832792525] [2020-02-10 20:03:26,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:26,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:26,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710668253] [2020-02-10 20:03:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:26,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:26,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:26,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:26,889 INFO L87 Difference]: Start difference. First operand 6223 states and 34155 transitions. Second operand 13 states. [2020-02-10 20:03:27,276 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:03:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:27,302 INFO L93 Difference]: Finished difference Result 11877 states and 58540 transitions. [2020-02-10 20:03:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:27,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:27,334 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 20:03:27,334 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:03:27,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:03:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:03:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:03:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34126 transitions. [2020-02-10 20:03:27,968 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34126 transitions. Word has length 34 [2020-02-10 20:03:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:27,969 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34126 transitions. [2020-02-10 20:03:27,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34126 transitions. [2020-02-10 20:03:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:27,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:27,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:27,980 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 239190494, now seen corresponding path program 51 times [2020-02-10 20:03:27,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:27,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132196142] [2020-02-10 20:03:27,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:28,656 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:03:28,807 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:28,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132196142] [2020-02-10 20:03:28,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:28,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:28,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623063382] [2020-02-10 20:03:28,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:28,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:28,820 INFO L87 Difference]: Start difference. First operand 6211 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:03:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:29,063 INFO L93 Difference]: Finished difference Result 11870 states and 58525 transitions. [2020-02-10 20:03:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:29,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:29,092 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:03:29,092 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:03:29,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:03:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6218. [2020-02-10 20:03:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:03:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34138 transitions. [2020-02-10 20:03:29,734 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34138 transitions. Word has length 34 [2020-02-10 20:03:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:29,734 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34138 transitions. [2020-02-10 20:03:29,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34138 transitions. [2020-02-10 20:03:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:29,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:29,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:29,748 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 27034876, now seen corresponding path program 52 times [2020-02-10 20:03:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:29,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098659534] [2020-02-10 20:03:29,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:30,436 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:03:30,590 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:30,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098659534] [2020-02-10 20:03:30,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:30,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:30,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34653255] [2020-02-10 20:03:30,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:30,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:30,603 INFO L87 Difference]: Start difference. First operand 6218 states and 34138 transitions. Second operand 13 states. [2020-02-10 20:03:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:30,891 INFO L93 Difference]: Finished difference Result 11864 states and 58507 transitions. [2020-02-10 20:03:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:30,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:30,920 INFO L225 Difference]: With dead ends: 11864 [2020-02-10 20:03:30,920 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:03:30,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:03:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6211. [2020-02-10 20:03:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:03:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34119 transitions. [2020-02-10 20:03:31,558 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34119 transitions. Word has length 34 [2020-02-10 20:03:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:31,558 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34119 transitions. [2020-02-10 20:03:31,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34119 transitions. [2020-02-10 20:03:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:31,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:31,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:31,569 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1771398882, now seen corresponding path program 53 times [2020-02-10 20:03:31,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:31,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869553855] [2020-02-10 20:03:31,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:32,380 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:32,526 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:32,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869553855] [2020-02-10 20:03:32,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:32,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:32,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557465840] [2020-02-10 20:03:32,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:32,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:32,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:32,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:32,539 INFO L87 Difference]: Start difference. First operand 6211 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:03:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:32,828 INFO L93 Difference]: Finished difference Result 11861 states and 58502 transitions. [2020-02-10 20:03:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:32,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:32,857 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:03:32,858 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:03:32,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:03:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6217. [2020-02-10 20:03:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:03:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 20:03:33,496 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 20:03:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:33,496 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 20:03:33,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 20:03:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:33,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:33,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:33,508 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1347087646, now seen corresponding path program 54 times [2020-02-10 20:03:33,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:33,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091306301] [2020-02-10 20:03:33,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:34,209 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:34,364 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:34,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091306301] [2020-02-10 20:03:34,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:34,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:34,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030802607] [2020-02-10 20:03:34,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:34,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:34,376 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:03:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:34,779 INFO L93 Difference]: Finished difference Result 11865 states and 58504 transitions. [2020-02-10 20:03:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:34,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:34,810 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 20:03:34,810 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:03:34,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:03:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6203. [2020-02-10 20:03:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:03:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34098 transitions. [2020-02-10 20:03:35,458 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34098 transitions. Word has length 34 [2020-02-10 20:03:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:35,458 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34098 transitions. [2020-02-10 20:03:35,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34098 transitions. [2020-02-10 20:03:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:35,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:35,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:35,470 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash 165542264, now seen corresponding path program 55 times [2020-02-10 20:03:35,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:35,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118750448] [2020-02-10 20:03:35,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:36,041 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:36,192 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:03:36,343 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:03:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:36,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118750448] [2020-02-10 20:03:36,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:36,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:36,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734701392] [2020-02-10 20:03:36,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:36,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:36,355 INFO L87 Difference]: Start difference. First operand 6203 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:03:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:36,624 INFO L93 Difference]: Finished difference Result 11892 states and 58583 transitions. [2020-02-10 20:03:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:36,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:36,744 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 20:03:36,745 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:03:36,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:03:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6227. [2020-02-10 20:03:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:03:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34160 transitions. [2020-02-10 20:03:37,378 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34160 transitions. Word has length 34 [2020-02-10 20:03:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:37,378 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34160 transitions. [2020-02-10 20:03:37,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34160 transitions. [2020-02-10 20:03:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:37,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:37,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:37,389 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash -470924590, now seen corresponding path program 56 times [2020-02-10 20:03:37,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:37,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949967350] [2020-02-10 20:03:37,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:37,960 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:38,100 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:38,250 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:38,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949967350] [2020-02-10 20:03:38,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:38,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:38,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524517481] [2020-02-10 20:03:38,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:38,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:38,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:38,262 INFO L87 Difference]: Start difference. First operand 6227 states and 34160 transitions. Second operand 13 states. [2020-02-10 20:03:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:38,560 INFO L93 Difference]: Finished difference Result 11890 states and 58569 transitions. [2020-02-10 20:03:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:38,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:38,590 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:03:38,590 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 20:03:38,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 20:03:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6215. [2020-02-10 20:03:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:03:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34128 transitions. [2020-02-10 20:03:39,233 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34128 transitions. Word has length 34 [2020-02-10 20:03:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:39,233 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34128 transitions. [2020-02-10 20:03:39,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34128 transitions. [2020-02-10 20:03:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:39,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:39,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:39,245 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1093561694, now seen corresponding path program 57 times [2020-02-10 20:03:39,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:39,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566326569] [2020-02-10 20:03:39,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:39,798 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:39,950 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:03:40,099 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:40,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566326569] [2020-02-10 20:03:40,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:40,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:40,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205839395] [2020-02-10 20:03:40,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:40,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:40,112 INFO L87 Difference]: Start difference. First operand 6215 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:03:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:40,383 INFO L93 Difference]: Finished difference Result 11889 states and 58566 transitions. [2020-02-10 20:03:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:40,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:40,413 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:03:40,413 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 20:03:40,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 20:03:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6225. [2020-02-10 20:03:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:03:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34146 transitions. [2020-02-10 20:03:41,056 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34146 transitions. Word has length 34 [2020-02-10 20:03:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:41,057 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34146 transitions. [2020-02-10 20:03:41,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34146 transitions. [2020-02-10 20:03:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:41,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:41,068 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:41,068 INFO L82 PathProgramCache]: Analyzing trace with hash -603683250, now seen corresponding path program 58 times [2020-02-10 20:03:41,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:41,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899800525] [2020-02-10 20:03:41,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:41,292 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-02-10 20:03:41,735 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:41,882 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:42,031 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899800525] [2020-02-10 20:03:42,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:42,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:42,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257949077] [2020-02-10 20:03:42,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:42,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:42,043 INFO L87 Difference]: Start difference. First operand 6225 states and 34146 transitions. Second operand 13 states. [2020-02-10 20:03:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:42,348 INFO L93 Difference]: Finished difference Result 11886 states and 58551 transitions. [2020-02-10 20:03:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:42,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:42,377 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:03:42,378 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:03:42,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:03:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6215. [2020-02-10 20:03:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:03:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34118 transitions. [2020-02-10 20:03:43,021 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34118 transitions. Word has length 34 [2020-02-10 20:03:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:43,021 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34118 transitions. [2020-02-10 20:03:43,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34118 transitions. [2020-02-10 20:03:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:43,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:43,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:43,033 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2093508450, now seen corresponding path program 59 times [2020-02-10 20:03:43,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:43,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036187204] [2020-02-10 20:03:43,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:43,598 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:43,747 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:43,896 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:03:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:43,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036187204] [2020-02-10 20:03:43,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:43,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:43,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617844055] [2020-02-10 20:03:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:43,909 INFO L87 Difference]: Start difference. First operand 6215 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:03:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:44,327 INFO L93 Difference]: Finished difference Result 11884 states and 58548 transitions. [2020-02-10 20:03:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:44,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:44,359 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:03:44,359 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:03:44,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:03:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6224. [2020-02-10 20:03:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:03:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34135 transitions. [2020-02-10 20:03:44,997 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34135 transitions. Word has length 34 [2020-02-10 20:03:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:44,997 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34135 transitions. [2020-02-10 20:03:44,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34135 transitions. [2020-02-10 20:03:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:45,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:45,008 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1140680756, now seen corresponding path program 60 times [2020-02-10 20:03:45,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:45,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656421866] [2020-02-10 20:03:45,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:45,563 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:45,709 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:03:45,860 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:03:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:45,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656421866] [2020-02-10 20:03:45,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:45,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:45,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001297161] [2020-02-10 20:03:45,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:45,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:45,872 INFO L87 Difference]: Start difference. First operand 6224 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:03:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:46,201 INFO L93 Difference]: Finished difference Result 11883 states and 58537 transitions. [2020-02-10 20:03:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:46,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:46,231 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:03:46,232 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:03:46,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:03:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6203. [2020-02-10 20:03:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:03:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34089 transitions. [2020-02-10 20:03:46,953 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34089 transitions. Word has length 34 [2020-02-10 20:03:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:46,953 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34089 transitions. [2020-02-10 20:03:46,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34089 transitions. [2020-02-10 20:03:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:46,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:46,964 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1056978248, now seen corresponding path program 61 times [2020-02-10 20:03:46,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:46,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858295155] [2020-02-10 20:03:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:47,643 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:03:47,796 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:47,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858295155] [2020-02-10 20:03:47,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:47,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:47,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353288055] [2020-02-10 20:03:47,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:47,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:47,808 INFO L87 Difference]: Start difference. First operand 6203 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:03:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:48,070 INFO L93 Difference]: Finished difference Result 11866 states and 58508 transitions. [2020-02-10 20:03:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:48,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:48,100 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:03:48,100 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:03:48,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:03:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6217. [2020-02-10 20:03:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:03:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34127 transitions. [2020-02-10 20:03:48,740 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34127 transitions. Word has length 34 [2020-02-10 20:03:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:48,740 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34127 transitions. [2020-02-10 20:03:48,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34127 transitions. [2020-02-10 20:03:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:48,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:48,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:48,752 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1269133866, now seen corresponding path program 62 times [2020-02-10 20:03:48,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:48,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337898021] [2020-02-10 20:03:48,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:49,418 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:49,566 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:49,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337898021] [2020-02-10 20:03:49,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:49,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:49,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341313229] [2020-02-10 20:03:49,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:49,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:49,579 INFO L87 Difference]: Start difference. First operand 6217 states and 34127 transitions. Second operand 13 states. [2020-02-10 20:03:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:49,878 INFO L93 Difference]: Finished difference Result 11860 states and 58490 transitions. [2020-02-10 20:03:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:49,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:49,909 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:03:49,909 INFO L226 Difference]: Without dead ends: 11835 [2020-02-10 20:03:49,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2020-02-10 20:03:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 6210. [2020-02-10 20:03:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:03:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34108 transitions. [2020-02-10 20:03:50,555 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34108 transitions. Word has length 34 [2020-02-10 20:03:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:50,555 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34108 transitions. [2020-02-10 20:03:50,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34108 transitions. [2020-02-10 20:03:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:50,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:50,566 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 149892902, now seen corresponding path program 63 times [2020-02-10 20:03:50,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:50,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662413849] [2020-02-10 20:03:50,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:51,168 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 20:03:51,311 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 20:03:51,503 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:51,741 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:03:51,963 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:51,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662413849] [2020-02-10 20:03:51,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:51,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:51,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121878770] [2020-02-10 20:03:51,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:51,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:51,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:51,989 INFO L87 Difference]: Start difference. First operand 6210 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:03:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:52,484 INFO L93 Difference]: Finished difference Result 11872 states and 58516 transitions. [2020-02-10 20:03:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:52,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:52,542 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:03:52,542 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:03:52,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:03:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6220. [2020-02-10 20:03:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:03:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34126 transitions. [2020-02-10 20:03:53,474 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34126 transitions. Word has length 34 [2020-02-10 20:03:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:53,475 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34126 transitions. [2020-02-10 20:03:53,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34126 transitions. [2020-02-10 20:03:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:53,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:53,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:53,486 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1547352042, now seen corresponding path program 64 times [2020-02-10 20:03:53,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:53,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863302365] [2020-02-10 20:03:53,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:54,024 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:54,170 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:54,321 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:54,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863302365] [2020-02-10 20:03:54,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:54,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:54,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510302892] [2020-02-10 20:03:54,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:54,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:54,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:54,334 INFO L87 Difference]: Start difference. First operand 6220 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:03:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:54,678 INFO L93 Difference]: Finished difference Result 11869 states and 58501 transitions. [2020-02-10 20:03:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:54,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:54,707 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:03:54,707 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 20:03:54,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 20:03:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6210. [2020-02-10 20:03:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:03:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34101 transitions. [2020-02-10 20:03:55,347 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34101 transitions. Word has length 34 [2020-02-10 20:03:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:55,347 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34101 transitions. [2020-02-10 20:03:55,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34101 transitions. [2020-02-10 20:03:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:55,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:55,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:55,358 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1950847718, now seen corresponding path program 65 times [2020-02-10 20:03:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:55,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285879300] [2020-02-10 20:03:55,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:56,028 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:03:56,178 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:56,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285879300] [2020-02-10 20:03:56,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:56,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:56,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346461047] [2020-02-10 20:03:56,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:56,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:56,190 INFO L87 Difference]: Start difference. First operand 6210 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:03:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:56,525 INFO L93 Difference]: Finished difference Result 11856 states and 58476 transitions. [2020-02-10 20:03:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:56,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:56,555 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:03:56,555 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 20:03:56,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 20:03:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6216. [2020-02-10 20:03:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:03:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34112 transitions. [2020-02-10 20:03:57,274 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34112 transitions. Word has length 34 [2020-02-10 20:03:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:57,274 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34112 transitions. [2020-02-10 20:03:57,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34112 transitions. [2020-02-10 20:03:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:57,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:57,286 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 465758392, now seen corresponding path program 66 times [2020-02-10 20:03:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:57,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438851224] [2020-02-10 20:03:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:57,971 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:03:58,131 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:03:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:58,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438851224] [2020-02-10 20:03:58,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:58,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:03:58,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427559865] [2020-02-10 20:03:58,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:03:58,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:58,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:03:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:58,143 INFO L87 Difference]: Start difference. First operand 6216 states and 34112 transitions. Second operand 13 states. [2020-02-10 20:03:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:58,509 INFO L93 Difference]: Finished difference Result 11859 states and 58476 transitions. [2020-02-10 20:03:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:03:58,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:03:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:58,539 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 20:03:58,539 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 20:03:58,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:03:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 20:03:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6203. [2020-02-10 20:03:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:03:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34082 transitions. [2020-02-10 20:03:59,177 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34082 transitions. Word has length 34 [2020-02-10 20:03:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:59,177 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34082 transitions. [2020-02-10 20:03:59,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:03:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34082 transitions. [2020-02-10 20:03:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:03:59,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:59,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:59,188 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1284060522, now seen corresponding path program 67 times [2020-02-10 20:03:59,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:59,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728444392] [2020-02-10 20:03:59,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:59,959 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:00,104 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:04:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728444392] [2020-02-10 20:04:00,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:00,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385639144] [2020-02-10 20:04:00,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:00,116 INFO L87 Difference]: Start difference. First operand 6203 states and 34082 transitions. Second operand 13 states. [2020-02-10 20:04:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:00,452 INFO L93 Difference]: Finished difference Result 11852 states and 58475 transitions. [2020-02-10 20:04:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:00,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:00,482 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 20:04:00,482 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:04:00,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:04:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6215. [2020-02-10 20:04:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:04:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34116 transitions. [2020-02-10 20:04:01,122 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34116 transitions. Word has length 34 [2020-02-10 20:04:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:01,122 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34116 transitions. [2020-02-10 20:04:01,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34116 transitions. [2020-02-10 20:04:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:01,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:01,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:01,134 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1708371758, now seen corresponding path program 68 times [2020-02-10 20:04:01,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:01,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069528014] [2020-02-10 20:04:01,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:01,846 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:02,165 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:04:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:02,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069528014] [2020-02-10 20:04:02,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:02,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:02,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495788871] [2020-02-10 20:04:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:02,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:02,191 INFO L87 Difference]: Start difference. First operand 6215 states and 34116 transitions. Second operand 13 states. [2020-02-10 20:04:02,706 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:04:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:02,745 INFO L93 Difference]: Finished difference Result 11856 states and 58477 transitions. [2020-02-10 20:04:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:02,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:02,803 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:04:02,804 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:04:02,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:04:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6209. [2020-02-10 20:04:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:04:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34099 transitions. [2020-02-10 20:04:04,095 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34099 transitions. Word has length 34 [2020-02-10 20:04:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:04,095 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34099 transitions. [2020-02-10 20:04:04,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34099 transitions. [2020-02-10 20:04:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:04,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:04,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:04,106 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash 191557056, now seen corresponding path program 69 times [2020-02-10 20:04:04,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:04,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180377143] [2020-02-10 20:04:04,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:04,768 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:04:04,915 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:04:04,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 20:04:04,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180377143] [2020-02-10 20:04:04,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:04,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:04,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024565828] [2020-02-10 20:04:04,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:04,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:04,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:04,927 INFO L87 Difference]: Start difference. First operand 6209 states and 34099 transitions. Second operand 13 states. [2020-02-10 20:04:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:05,314 INFO L93 Difference]: Finished difference Result 11851 states and 58467 transitions. [2020-02-10 20:04:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:05,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:05,344 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:04:05,344 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:04:05,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:04:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6215. [2020-02-10 20:04:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:04:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 20:04:05,981 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 20:04:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:05,981 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 20:04:05,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 20:04:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:05,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:05,993 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1293532270, now seen corresponding path program 70 times [2020-02-10 20:04:05,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:05,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105134914] [2020-02-10 20:04:05,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:06,688 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:04:06,838 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:04:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:06,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105134914] [2020-02-10 20:04:06,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:06,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:06,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761329641] [2020-02-10 20:04:06,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:06,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:06,851 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:04:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:07,350 INFO L93 Difference]: Finished difference Result 11854 states and 58467 transitions. [2020-02-10 20:04:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:07,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:07,381 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:04:07,381 INFO L226 Difference]: Without dead ends: 11827 [2020-02-10 20:04:07,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11827 states. [2020-02-10 20:04:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11827 to 6209. [2020-02-10 20:04:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:04:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34093 transitions. [2020-02-10 20:04:08,111 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34093 transitions. Word has length 34 [2020-02-10 20:04:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:08,111 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34093 transitions. [2020-02-10 20:04:08,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34093 transitions. [2020-02-10 20:04:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:08,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:08,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:08,126 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash -501500608, now seen corresponding path program 71 times [2020-02-10 20:04:08,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:08,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857210254] [2020-02-10 20:04:08,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:08,577 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 20:04:08,702 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:08,850 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:09,002 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:04:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:09,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857210254] [2020-02-10 20:04:09,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:09,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:09,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394405924] [2020-02-10 20:04:09,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:09,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:09,015 INFO L87 Difference]: Start difference. First operand 6209 states and 34093 transitions. Second operand 13 states. [2020-02-10 20:04:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:09,484 INFO L93 Difference]: Finished difference Result 11862 states and 58486 transitions. [2020-02-10 20:04:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:09,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:09,512 INFO L225 Difference]: With dead ends: 11862 [2020-02-10 20:04:09,512 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 20:04:09,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 20:04:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6218. [2020-02-10 20:04:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:04:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 20:04:10,147 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 20:04:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:10,147 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 20:04:10,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 20:04:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:10,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:10,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:10,158 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1562278698, now seen corresponding path program 72 times [2020-02-10 20:04:10,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:10,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267586104] [2020-02-10 20:04:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:10,713 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:10,859 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:04:11,006 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:04:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267586104] [2020-02-10 20:04:11,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:11,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830122945] [2020-02-10 20:04:11,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:11,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:11,018 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:04:11,332 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-02-10 20:04:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:11,365 INFO L93 Difference]: Finished difference Result 11861 states and 58475 transitions. [2020-02-10 20:04:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:11,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:11,404 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:04:11,405 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:04:11,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:04:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6194. [2020-02-10 20:04:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:04:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34059 transitions. [2020-02-10 20:04:12,057 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34059 transitions. Word has length 34 [2020-02-10 20:04:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:12,057 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34059 transitions. [2020-02-10 20:04:12,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34059 transitions. [2020-02-10 20:04:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:12,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:12,068 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2058767766, now seen corresponding path program 73 times [2020-02-10 20:04:12,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:12,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65096668] [2020-02-10 20:04:12,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:12,617 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:04:12,759 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:12,906 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:12,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65096668] [2020-02-10 20:04:12,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:12,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:12,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280974740] [2020-02-10 20:04:12,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:12,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:12,918 INFO L87 Difference]: Start difference. First operand 6194 states and 34059 transitions. Second operand 13 states. [2020-02-10 20:04:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:13,259 INFO L93 Difference]: Finished difference Result 11843 states and 58462 transitions. [2020-02-10 20:04:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:13,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:13,288 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 20:04:13,288 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:04:13,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:04:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6216. [2020-02-10 20:04:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:04:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 20:04:13,927 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 20:04:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:13,927 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 20:04:13,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 20:04:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:13,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:13,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:13,938 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:13,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1073831482, now seen corresponding path program 74 times [2020-02-10 20:04:13,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:13,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851429908] [2020-02-10 20:04:13,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:14,561 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2020-02-10 20:04:14,759 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:04:14,981 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:15,212 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:15,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851429908] [2020-02-10 20:04:15,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:15,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:15,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625239569] [2020-02-10 20:04:15,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:15,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:15,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:15,238 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:04:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:15,645 INFO L93 Difference]: Finished difference Result 11848 states and 58464 transitions. [2020-02-10 20:04:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:15,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:15,701 INFO L225 Difference]: With dead ends: 11848 [2020-02-10 20:04:15,701 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:04:15,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:04:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6208. [2020-02-10 20:04:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:04:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34111 transitions. [2020-02-10 20:04:16,912 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34111 transitions. Word has length 34 [2020-02-10 20:04:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:16,913 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34111 transitions. [2020-02-10 20:04:16,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34111 transitions. [2020-02-10 20:04:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:16,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:16,924 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash -223089096, now seen corresponding path program 75 times [2020-02-10 20:04:16,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:16,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287146448] [2020-02-10 20:04:16,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:17,480 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:17,630 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:17,792 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:17,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287146448] [2020-02-10 20:04:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479199776] [2020-02-10 20:04:17,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:17,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:17,805 INFO L87 Difference]: Start difference. First operand 6208 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:04:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:18,183 INFO L93 Difference]: Finished difference Result 11835 states and 58439 transitions. [2020-02-10 20:04:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:18,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:18,213 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:04:18,213 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:04:18,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:04:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6214. [2020-02-10 20:04:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:04:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34122 transitions. [2020-02-10 20:04:18,978 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34122 transitions. Word has length 34 [2020-02-10 20:04:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:18,978 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34122 transitions. [2020-02-10 20:04:18,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34122 transitions. [2020-02-10 20:04:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:18,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:18,990 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 385561566, now seen corresponding path program 76 times [2020-02-10 20:04:18,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:18,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367725043] [2020-02-10 20:04:18,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:19,529 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:19,669 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:19,822 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:19,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367725043] [2020-02-10 20:04:19,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:19,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326779247] [2020-02-10 20:04:19,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:19,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:19,834 INFO L87 Difference]: Start difference. First operand 6214 states and 34122 transitions. Second operand 13 states. [2020-02-10 20:04:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:20,141 INFO L93 Difference]: Finished difference Result 11834 states and 58431 transitions. [2020-02-10 20:04:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:20,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:20,171 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 20:04:20,171 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 20:04:20,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 20:04:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6208. [2020-02-10 20:04:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:04:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34105 transitions. [2020-02-10 20:04:20,811 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34105 transitions. Word has length 34 [2020-02-10 20:04:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:20,811 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34105 transitions. [2020-02-10 20:04:20,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34105 transitions. [2020-02-10 20:04:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:20,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:20,823 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1532834476, now seen corresponding path program 77 times [2020-02-10 20:04:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:20,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999054240] [2020-02-10 20:04:20,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:21,514 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:21,660 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:21,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999054240] [2020-02-10 20:04:21,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:21,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:21,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664062148] [2020-02-10 20:04:21,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:21,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:21,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:21,672 INFO L87 Difference]: Start difference. First operand 6208 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:04:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:22,018 INFO L93 Difference]: Finished difference Result 11846 states and 58453 transitions. [2020-02-10 20:04:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:22,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:22,048 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:04:22,048 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:04:22,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:04:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:04:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:04:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34117 transitions. [2020-02-10 20:04:22,684 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34117 transitions. Word has length 34 [2020-02-10 20:04:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:22,684 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34117 transitions. [2020-02-10 20:04:22,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34117 transitions. [2020-02-10 20:04:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:22,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:22,696 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1259255870, now seen corresponding path program 78 times [2020-02-10 20:04:22,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:22,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491624877] [2020-02-10 20:04:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:23,380 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:23,529 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:23,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491624877] [2020-02-10 20:04:23,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:23,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:23,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571866792] [2020-02-10 20:04:23,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:23,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:23,541 INFO L87 Difference]: Start difference. First operand 6215 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:04:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:23,883 INFO L93 Difference]: Finished difference Result 11840 states and 58435 transitions. [2020-02-10 20:04:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:23,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:23,913 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:04:23,913 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:04:23,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:04:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6201. [2020-02-10 20:04:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:04:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34085 transitions. [2020-02-10 20:04:24,626 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34085 transitions. Word has length 34 [2020-02-10 20:04:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:24,626 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34085 transitions. [2020-02-10 20:04:24,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34085 transitions. [2020-02-10 20:04:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:24,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:24,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:24,638 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:24,638 INFO L82 PathProgramCache]: Analyzing trace with hash 817067752, now seen corresponding path program 79 times [2020-02-10 20:04:24,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:24,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701684912] [2020-02-10 20:04:24,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:25,459 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:25,606 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:25,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701684912] [2020-02-10 20:04:25,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:25,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:25,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416051502] [2020-02-10 20:04:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:25,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:25,618 INFO L87 Difference]: Start difference. First operand 6201 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:04:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:25,951 INFO L93 Difference]: Finished difference Result 11851 states and 58477 transitions. [2020-02-10 20:04:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:25,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:25,981 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:04:25,982 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 20:04:25,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 20:04:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6217. [2020-02-10 20:04:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:04:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 20:04:26,626 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 20:04:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:26,626 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 20:04:26,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 20:04:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:26,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:26,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:26,637 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash -167868532, now seen corresponding path program 80 times [2020-02-10 20:04:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404768802] [2020-02-10 20:04:26,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:27,206 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:04:27,353 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:27,507 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:27,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404768802] [2020-02-10 20:04:27,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:27,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910875589] [2020-02-10 20:04:27,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:27,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:27,519 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:04:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:27,897 INFO L93 Difference]: Finished difference Result 11856 states and 58479 transitions. [2020-02-10 20:04:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:27,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:27,927 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:04:27,927 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:04:27,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:04:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6209. [2020-02-10 20:04:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:04:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34107 transitions. [2020-02-10 20:04:28,566 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34107 transitions. Word has length 34 [2020-02-10 20:04:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:28,566 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34107 transitions. [2020-02-10 20:04:28,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34107 transitions. [2020-02-10 20:04:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:28,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:28,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:28,578 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash -257917960, now seen corresponding path program 81 times [2020-02-10 20:04:28,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:28,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292418247] [2020-02-10 20:04:28,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:29,364 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:29,510 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:29,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292418247] [2020-02-10 20:04:29,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:29,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:29,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124558603] [2020-02-10 20:04:29,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:29,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:29,523 INFO L87 Difference]: Start difference. First operand 6209 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:04:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:29,977 INFO L93 Difference]: Finished difference Result 11847 states and 58462 transitions. [2020-02-10 20:04:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:29,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:30,006 INFO L225 Difference]: With dead ends: 11847 [2020-02-10 20:04:30,006 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:04:30,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:04:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 20:04:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:04:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34120 transitions. [2020-02-10 20:04:30,644 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34120 transitions. Word has length 34 [2020-02-10 20:04:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:30,645 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34120 transitions. [2020-02-10 20:04:30,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34120 transitions. [2020-02-10 20:04:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:30,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:30,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:30,656 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1158242348, now seen corresponding path program 82 times [2020-02-10 20:04:30,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:30,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423984469] [2020-02-10 20:04:30,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:31,341 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:31,491 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:31,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423984469] [2020-02-10 20:04:31,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:31,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:31,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216688945] [2020-02-10 20:04:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:31,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:31,503 INFO L87 Difference]: Start difference. First operand 6216 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:04:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:31,831 INFO L93 Difference]: Finished difference Result 11849 states and 58459 transitions. [2020-02-10 20:04:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:31,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:31,861 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 20:04:31,862 INFO L226 Difference]: Without dead ends: 11821 [2020-02-10 20:04:31,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-02-10 20:04:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 6209. [2020-02-10 20:04:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:04:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34100 transitions. [2020-02-10 20:04:32,499 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34100 transitions. Word has length 34 [2020-02-10 20:04:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:32,499 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34100 transitions. [2020-02-10 20:04:32,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34100 transitions. [2020-02-10 20:04:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:32,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:32,510 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:32,510 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash 783428056, now seen corresponding path program 83 times [2020-02-10 20:04:32,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:32,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063949911] [2020-02-10 20:04:32,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:33,052 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:33,206 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:33,359 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:33,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063949911] [2020-02-10 20:04:33,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:33,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:33,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025792855] [2020-02-10 20:04:33,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:33,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:33,371 INFO L87 Difference]: Start difference. First operand 6209 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:04:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:33,664 INFO L93 Difference]: Finished difference Result 11860 states and 58481 transitions. [2020-02-10 20:04:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:33,664 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:33,694 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:04:33,694 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 20:04:33,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 20:04:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6219. [2020-02-10 20:04:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:04:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34118 transitions. [2020-02-10 20:04:34,427 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34118 transitions. Word has length 34 [2020-02-10 20:04:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:34,428 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34118 transitions. [2020-02-10 20:04:34,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34118 transitions. [2020-02-10 20:04:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:34,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:34,439 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash -469787928, now seen corresponding path program 84 times [2020-02-10 20:04:34,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:34,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876973332] [2020-02-10 20:04:34,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:35,000 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:35,145 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:35,297 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876973332] [2020-02-10 20:04:35,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:35,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:35,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42513694] [2020-02-10 20:04:35,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:35,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:35,309 INFO L87 Difference]: Start difference. First operand 6219 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:04:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:35,602 INFO L93 Difference]: Finished difference Result 11857 states and 58466 transitions. [2020-02-10 20:04:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:35,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:35,636 INFO L225 Difference]: With dead ends: 11857 [2020-02-10 20:04:35,637 INFO L226 Difference]: Without dead ends: 11818 [2020-02-10 20:04:35,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11818 states. [2020-02-10 20:04:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11818 to 6201. [2020-02-10 20:04:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:04:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34078 transitions. [2020-02-10 20:04:36,276 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34078 transitions. Word has length 34 [2020-02-10 20:04:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:36,276 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34078 transitions. [2020-02-10 20:04:36,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34078 transitions. [2020-02-10 20:04:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:36,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:36,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:36,288 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash 812092200, now seen corresponding path program 85 times [2020-02-10 20:04:36,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:36,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209135668] [2020-02-10 20:04:36,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:36,974 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:37,120 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:37,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209135668] [2020-02-10 20:04:37,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:37,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:37,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654894640] [2020-02-10 20:04:37,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:37,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:37,132 INFO L87 Difference]: Start difference. First operand 6201 states and 34078 transitions. Second operand 13 states. [2020-02-10 20:04:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:37,453 INFO L93 Difference]: Finished difference Result 11829 states and 58420 transitions. [2020-02-10 20:04:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:37,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:37,482 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:04:37,482 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 20:04:37,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 20:04:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6213. [2020-02-10 20:04:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:04:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34112 transitions. [2020-02-10 20:04:38,127 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34112 transitions. Word has length 34 [2020-02-10 20:04:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:38,127 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34112 transitions. [2020-02-10 20:04:38,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34112 transitions. [2020-02-10 20:04:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:38,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:38,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:38,138 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742862, now seen corresponding path program 86 times [2020-02-10 20:04:38,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:38,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565383760] [2020-02-10 20:04:38,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:38,675 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:38,815 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:38,968 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:38,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565383760] [2020-02-10 20:04:38,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:38,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:38,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726876800] [2020-02-10 20:04:38,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:38,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:38,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:38,979 INFO L87 Difference]: Start difference. First operand 6213 states and 34112 transitions. Second operand 13 states. [2020-02-10 20:04:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:39,284 INFO L93 Difference]: Finished difference Result 11828 states and 58412 transitions. [2020-02-10 20:04:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:39,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:39,313 INFO L225 Difference]: With dead ends: 11828 [2020-02-10 20:04:39,313 INFO L226 Difference]: Without dead ends: 11804 [2020-02-10 20:04:39,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2020-02-10 20:04:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 6207. [2020-02-10 20:04:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:04:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34095 transitions. [2020-02-10 20:04:40,034 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34095 transitions. Word has length 34 [2020-02-10 20:04:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:40,034 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34095 transitions. [2020-02-10 20:04:40,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34095 transitions. [2020-02-10 20:04:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:40,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:40,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:40,045 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2018963350, now seen corresponding path program 87 times [2020-02-10 20:04:40,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:40,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218710623] [2020-02-10 20:04:40,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:40,716 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:40,863 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:40,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218710623] [2020-02-10 20:04:40,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:40,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:40,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766699596] [2020-02-10 20:04:40,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:40,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:40,874 INFO L87 Difference]: Start difference. First operand 6207 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:04:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:41,195 INFO L93 Difference]: Finished difference Result 11833 states and 58423 transitions. [2020-02-10 20:04:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:41,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:41,225 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:04:41,225 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:04:41,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:04:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 20:04:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:04:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34108 transitions. [2020-02-10 20:04:41,863 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34108 transitions. Word has length 34 [2020-02-10 20:04:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:41,863 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34108 transitions. [2020-02-10 20:04:41,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34108 transitions. [2020-02-10 20:04:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:41,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:41,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:41,873 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -859843638, now seen corresponding path program 88 times [2020-02-10 20:04:41,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:41,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590743193] [2020-02-10 20:04:41,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:42,567 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:42,718 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:42,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 20:04:42,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590743193] [2020-02-10 20:04:42,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:42,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:42,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64121519] [2020-02-10 20:04:42,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:42,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:42,730 INFO L87 Difference]: Start difference. First operand 6214 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:04:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:43,112 INFO L93 Difference]: Finished difference Result 11835 states and 58420 transitions. [2020-02-10 20:04:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:43,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:43,142 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:04:43,142 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:04:43,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:04:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 20:04:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:04:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 20:04:43,779 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 20:04:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:43,779 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 20:04:43,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 20:04:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:43,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:43,791 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 526171826, now seen corresponding path program 89 times [2020-02-10 20:04:43,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:43,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890823113] [2020-02-10 20:04:43,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:44,480 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:44,743 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:44,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890823113] [2020-02-10 20:04:44,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:44,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:44,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775831145] [2020-02-10 20:04:44,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:44,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:44,760 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:04:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:45,093 INFO L93 Difference]: Finished difference Result 11830 states and 58410 transitions. [2020-02-10 20:04:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:45,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:45,123 INFO L225 Difference]: With dead ends: 11830 [2020-02-10 20:04:45,123 INFO L226 Difference]: Without dead ends: 11812 [2020-02-10 20:04:45,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2020-02-10 20:04:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 6213. [2020-02-10 20:04:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:04:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 20:04:45,768 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 20:04:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:45,769 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 20:04:45,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 20:04:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:45,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:45,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:45,780 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:45,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash 828457700, now seen corresponding path program 90 times [2020-02-10 20:04:45,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:45,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793500974] [2020-02-10 20:04:45,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:46,450 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:46,599 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:46,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793500974] [2020-02-10 20:04:46,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:46,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:46,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716407143] [2020-02-10 20:04:46,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:46,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:46,611 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:04:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:46,992 INFO L93 Difference]: Finished difference Result 11833 states and 58410 transitions. [2020-02-10 20:04:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:46,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:47,022 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:04:47,022 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:04:47,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:04:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6201. [2020-02-10 20:04:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:04:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34072 transitions. [2020-02-10 20:04:47,661 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34072 transitions. Word has length 34 [2020-02-10 20:04:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:47,662 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34072 transitions. [2020-02-10 20:04:47,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34072 transitions. [2020-02-10 20:04:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:47,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:47,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:47,673 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 800234480, now seen corresponding path program 91 times [2020-02-10 20:04:47,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:47,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008854111] [2020-02-10 20:04:47,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:48,366 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:48,511 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:48,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008854111] [2020-02-10 20:04:48,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:48,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:48,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376005383] [2020-02-10 20:04:48,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:48,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:48,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:48,523 INFO L87 Difference]: Start difference. First operand 6201 states and 34072 transitions. Second operand 13 states. [2020-02-10 20:04:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:48,966 INFO L93 Difference]: Finished difference Result 11850 states and 58456 transitions. [2020-02-10 20:04:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:48,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:48,996 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 20:04:48,997 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:04:48,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:04:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6215. [2020-02-10 20:04:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:04:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 20:04:49,755 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 20:04:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:49,755 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 20:04:49,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 20:04:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:49,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:49,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:49,767 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1073813086, now seen corresponding path program 92 times [2020-02-10 20:04:49,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:49,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295188847] [2020-02-10 20:04:49,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:50,423 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:50,568 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:50,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295188847] [2020-02-10 20:04:50,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:50,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:50,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214512247] [2020-02-10 20:04:50,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:50,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:50,580 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:04:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:50,996 INFO L93 Difference]: Finished difference Result 11844 states and 58438 transitions. [2020-02-10 20:04:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:50,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:51,025 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 20:04:51,026 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:04:51,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:04:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6208. [2020-02-10 20:04:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:04:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34091 transitions. [2020-02-10 20:04:51,665 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34091 transitions. Word has length 34 [2020-02-10 20:04:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:51,665 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34091 transitions. [2020-02-10 20:04:51,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34091 transitions. [2020-02-10 20:04:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:51,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:51,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:51,677 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1581161982, now seen corresponding path program 93 times [2020-02-10 20:04:51,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:51,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855901400] [2020-02-10 20:04:51,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:52,207 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:52,362 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:04:52,510 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:52,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855901400] [2020-02-10 20:04:52,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:52,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:52,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798352059] [2020-02-10 20:04:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:52,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:52,521 INFO L87 Difference]: Start difference. First operand 6208 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:04:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:52,814 INFO L93 Difference]: Finished difference Result 11856 states and 58464 transitions. [2020-02-10 20:04:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:52,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:52,844 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:04:52,844 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 20:04:52,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 20:04:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6218. [2020-02-10 20:04:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:04:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34109 transitions. [2020-02-10 20:04:53,487 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34109 transitions. Word has length 34 [2020-02-10 20:04:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:53,487 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34109 transitions. [2020-02-10 20:04:53,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34109 transitions. [2020-02-10 20:04:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:53,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:53,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:53,498 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash 327945998, now seen corresponding path program 94 times [2020-02-10 20:04:53,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:53,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833004488] [2020-02-10 20:04:53,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:54,021 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:54,167 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:54,319 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:54,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833004488] [2020-02-10 20:04:54,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:54,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:54,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429814153] [2020-02-10 20:04:54,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:54,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:54,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:54,330 INFO L87 Difference]: Start difference. First operand 6218 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:04:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:54,627 INFO L93 Difference]: Finished difference Result 11853 states and 58449 transitions. [2020-02-10 20:04:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:54,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:54,657 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:04:54,657 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:04:54,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:04:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6208. [2020-02-10 20:04:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:04:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34084 transitions. [2020-02-10 20:04:55,378 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34084 transitions. Word has length 34 [2020-02-10 20:04:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:55,378 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34084 transitions. [2020-02-10 20:04:55,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34084 transitions. [2020-02-10 20:04:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:55,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:55,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:55,389 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:55,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1076438862, now seen corresponding path program 95 times [2020-02-10 20:04:55,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:55,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730749637] [2020-02-10 20:04:55,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:56,210 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:04:56,364 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:56,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 20:04:56,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730749637] [2020-02-10 20:04:56,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:56,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:56,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745427716] [2020-02-10 20:04:56,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:56,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:56,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:56,376 INFO L87 Difference]: Start difference. First operand 6208 states and 34084 transitions. Second operand 13 states. [2020-02-10 20:04:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:56,692 INFO L93 Difference]: Finished difference Result 11840 states and 58424 transitions. [2020-02-10 20:04:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:56,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:56,722 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:04:56,723 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:04:56,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:04:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6214. [2020-02-10 20:04:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:04:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 20:04:57,369 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 20:04:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:57,370 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 20:04:57,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 20:04:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:57,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:57,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:57,381 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1378724736, now seen corresponding path program 96 times [2020-02-10 20:04:57,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:57,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346767871] [2020-02-10 20:04:57,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:58,060 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:04:58,214 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:04:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:58,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346767871] [2020-02-10 20:04:58,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:58,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:04:58,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350518616] [2020-02-10 20:04:58,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:04:58,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:04:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:58,226 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:04:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:58,534 INFO L93 Difference]: Finished difference Result 11843 states and 58424 transitions. [2020-02-10 20:04:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:04:58,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:04:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:58,566 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 20:04:58,566 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:04:58,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:04:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:04:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6194. [2020-02-10 20:04:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:04:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34052 transitions. [2020-02-10 20:04:59,204 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34052 transitions. Word has length 34 [2020-02-10 20:04:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:59,204 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34052 transitions. [2020-02-10 20:04:59,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:04:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34052 transitions. [2020-02-10 20:04:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:04:59,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:59,216 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash -685815432, now seen corresponding path program 97 times [2020-02-10 20:04:59,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:59,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158894182] [2020-02-10 20:04:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:59,756 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:04:59,901 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:00,049 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:00,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158894182] [2020-02-10 20:05:00,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:00,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:00,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189119244] [2020-02-10 20:05:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:00,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:00,062 INFO L87 Difference]: Start difference. First operand 6194 states and 34052 transitions. Second operand 13 states. [2020-02-10 20:05:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:00,475 INFO L93 Difference]: Finished difference Result 11821 states and 58407 transitions. [2020-02-10 20:05:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:00,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:00,506 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 20:05:00,506 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:05:00,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:05:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6212. [2020-02-10 20:05:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34115 transitions. [2020-02-10 20:05:01,146 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34115 transitions. Word has length 34 [2020-02-10 20:05:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:01,146 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34115 transitions. [2020-02-10 20:05:01,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34115 transitions. [2020-02-10 20:05:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:01,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:01,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:01,158 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash -77164770, now seen corresponding path program 98 times [2020-02-10 20:05:01,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:01,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073587928] [2020-02-10 20:05:01,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:01,707 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:05:01,850 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:02,003 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:02,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073587928] [2020-02-10 20:05:02,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:02,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:02,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166190463] [2020-02-10 20:05:02,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:02,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:02,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:02,015 INFO L87 Difference]: Start difference. First operand 6212 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:05:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:02,327 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 20:05:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:02,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:02,358 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 20:05:02,358 INFO L226 Difference]: Without dead ends: 11796 [2020-02-10 20:05:02,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11796 states. [2020-02-10 20:05:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11796 to 6206. [2020-02-10 20:05:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 20:05:03,003 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 20:05:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:03,003 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 20:05:03,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 20:05:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:03,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:03,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:03,014 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -954561860, now seen corresponding path program 99 times [2020-02-10 20:05:03,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:03,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680216678] [2020-02-10 20:05:03,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:03,675 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:03,828 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:03,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680216678] [2020-02-10 20:05:03,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:03,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:03,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632737202] [2020-02-10 20:05:03,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:03,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:03,840 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:05:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:04,148 INFO L93 Difference]: Finished difference Result 11826 states and 58412 transitions. [2020-02-10 20:05:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:04,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:04,177 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:05:04,178 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:05:04,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:05:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6213. [2020-02-10 20:05:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:05:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34111 transitions. [2020-02-10 20:05:04,817 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34111 transitions. Word has length 34 [2020-02-10 20:05:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:04,817 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34111 transitions. [2020-02-10 20:05:04,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34111 transitions. [2020-02-10 20:05:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:04,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:04,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:04,829 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1163024614, now seen corresponding path program 100 times [2020-02-10 20:05:04,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:04,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115919688] [2020-02-10 20:05:04,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:05,601 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:05,749 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:05,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115919688] [2020-02-10 20:05:05,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:05,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:05,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464968950] [2020-02-10 20:05:05,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:05,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:05,761 INFO L87 Difference]: Start difference. First operand 6213 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:05:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:06,070 INFO L93 Difference]: Finished difference Result 11829 states and 58411 transitions. [2020-02-10 20:05:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:06,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:06,099 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:05:06,099 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:05:06,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:05:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6206. [2020-02-10 20:05:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 20:05:06,760 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 20:05:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:06,760 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 20:05:06,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 20:05:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:06,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:06,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:06,771 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash -366897982, now seen corresponding path program 101 times [2020-02-10 20:05:06,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:06,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490557653] [2020-02-10 20:05:06,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:07,426 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:07,578 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:07,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490557653] [2020-02-10 20:05:07,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:07,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:07,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341692226] [2020-02-10 20:05:07,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:07,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:07,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:07,590 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 20:05:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:07,890 INFO L93 Difference]: Finished difference Result 11823 states and 58399 transitions. [2020-02-10 20:05:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:07,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:07,919 INFO L225 Difference]: With dead ends: 11823 [2020-02-10 20:05:07,919 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 20:05:07,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 20:05:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6212. [2020-02-10 20:05:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34103 transitions. [2020-02-10 20:05:08,560 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34103 transitions. Word has length 34 [2020-02-10 20:05:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:08,560 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34103 transitions. [2020-02-10 20:05:08,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34103 transitions. [2020-02-10 20:05:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:08,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:08,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:08,572 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:08,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:08,572 INFO L82 PathProgramCache]: Analyzing trace with hash 525276724, now seen corresponding path program 102 times [2020-02-10 20:05:08,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:08,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871885112] [2020-02-10 20:05:08,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:09,233 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:09,381 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:09,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 20:05:09,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871885112] [2020-02-10 20:05:09,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:09,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:09,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122325011] [2020-02-10 20:05:09,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:09,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:09,391 INFO L87 Difference]: Start difference. First operand 6212 states and 34103 transitions. Second operand 13 states. [2020-02-10 20:05:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:09,723 INFO L93 Difference]: Finished difference Result 11827 states and 58401 transitions. [2020-02-10 20:05:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:09,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:09,753 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 20:05:09,753 INFO L226 Difference]: Without dead ends: 11793 [2020-02-10 20:05:09,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2020-02-10 20:05:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 6200. [2020-02-10 20:05:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:05:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34075 transitions. [2020-02-10 20:05:10,496 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34075 transitions. Word has length 34 [2020-02-10 20:05:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:10,496 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34075 transitions. [2020-02-10 20:05:10,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34075 transitions. [2020-02-10 20:05:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:10,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:10,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:10,508 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2108656526, now seen corresponding path program 103 times [2020-02-10 20:05:10,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:10,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712538333] [2020-02-10 20:05:10,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:11,042 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:11,186 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:11,338 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:11,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 20:05:11,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712538333] [2020-02-10 20:05:11,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:11,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:11,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217222528] [2020-02-10 20:05:11,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:11,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:11,350 INFO L87 Difference]: Start difference. First operand 6200 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:05:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:11,777 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 20:05:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:11,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:11,806 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 20:05:11,806 INFO L226 Difference]: Without dead ends: 11801 [2020-02-10 20:05:11,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2020-02-10 20:05:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 6212. [2020-02-10 20:05:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34109 transitions. [2020-02-10 20:05:12,443 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34109 transitions. Word has length 34 [2020-02-10 20:05:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:12,443 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34109 transitions. [2020-02-10 20:05:12,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34109 transitions. [2020-02-10 20:05:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:12,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:12,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:12,454 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1577660108, now seen corresponding path program 104 times [2020-02-10 20:05:12,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:12,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681497943] [2020-02-10 20:05:12,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:12,976 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:13,116 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:13,273 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:13,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681497943] [2020-02-10 20:05:13,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:13,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:13,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743885222] [2020-02-10 20:05:13,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:13,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:13,285 INFO L87 Difference]: Start difference. First operand 6212 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:05:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:13,698 INFO L93 Difference]: Finished difference Result 11819 states and 58391 transitions. [2020-02-10 20:05:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:13,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:13,728 INFO L225 Difference]: With dead ends: 11819 [2020-02-10 20:05:13,728 INFO L226 Difference]: Without dead ends: 11795 [2020-02-10 20:05:13,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2020-02-10 20:05:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 6206. [2020-02-10 20:05:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 20:05:14,367 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 20:05:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:14,367 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 20:05:14,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 20:05:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:14,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:14,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:14,378 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash -979439620, now seen corresponding path program 105 times [2020-02-10 20:05:14,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:14,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605520434] [2020-02-10 20:05:14,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:14,907 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:05:15,050 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:15,197 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:15,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605520434] [2020-02-10 20:05:15,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:15,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:15,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339053034] [2020-02-10 20:05:15,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:15,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:15,210 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 20:05:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:15,509 INFO L93 Difference]: Finished difference Result 11824 states and 58402 transitions. [2020-02-10 20:05:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:15,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:15,539 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 20:05:15,539 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 20:05:15,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 20:05:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6213. [2020-02-10 20:05:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:05:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34105 transitions. [2020-02-10 20:05:16,253 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34105 transitions. Word has length 34 [2020-02-10 20:05:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:16,253 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34105 transitions. [2020-02-10 20:05:16,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34105 transitions. [2020-02-10 20:05:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:16,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:16,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:16,264 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 436720688, now seen corresponding path program 106 times [2020-02-10 20:05:16,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:16,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056904248] [2020-02-10 20:05:16,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:16,935 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:17,087 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:17,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056904248] [2020-02-10 20:05:17,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:17,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:17,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993322357] [2020-02-10 20:05:17,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:17,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:17,099 INFO L87 Difference]: Start difference. First operand 6213 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:05:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:17,423 INFO L93 Difference]: Finished difference Result 11826 states and 58399 transitions. [2020-02-10 20:05:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:17,424 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:17,453 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:05:17,454 INFO L226 Difference]: Without dead ends: 11798 [2020-02-10 20:05:17,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2020-02-10 20:05:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 6206. [2020-02-10 20:05:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34086 transitions. [2020-02-10 20:05:18,093 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34086 transitions. Word has length 34 [2020-02-10 20:05:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:18,093 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34086 transitions. [2020-02-10 20:05:18,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34086 transitions. [2020-02-10 20:05:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:18,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:18,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:18,104 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1822736152, now seen corresponding path program 107 times [2020-02-10 20:05:18,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:18,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060970591] [2020-02-10 20:05:18,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:18,770 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:18,922 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:18,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060970591] [2020-02-10 20:05:18,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:18,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:18,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584904564] [2020-02-10 20:05:18,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:18,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:18,934 INFO L87 Difference]: Start difference. First operand 6206 states and 34086 transitions. Second operand 13 states. [2020-02-10 20:05:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:19,311 INFO L93 Difference]: Finished difference Result 11821 states and 58389 transitions. [2020-02-10 20:05:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:19,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:19,341 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 20:05:19,341 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:05:19,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:05:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6212. [2020-02-10 20:05:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:05:19,979 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:05:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:19,980 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:05:19,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:05:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:19,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:19,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:19,991 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2125022026, now seen corresponding path program 108 times [2020-02-10 20:05:19,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:19,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738855602] [2020-02-10 20:05:19,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:20,652 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:20,797 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:20,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738855602] [2020-02-10 20:05:20,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:20,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:20,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799301377] [2020-02-10 20:05:20,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:20,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:20,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:20,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:20,809 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:05:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:21,280 INFO L93 Difference]: Finished difference Result 11824 states and 58389 transitions. [2020-02-10 20:05:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:21,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:21,312 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 20:05:21,312 INFO L226 Difference]: Without dead ends: 11791 [2020-02-10 20:05:21,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11791 states. [2020-02-10 20:05:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11791 to 6200. [2020-02-10 20:05:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:05:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34069 transitions. [2020-02-10 20:05:21,952 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34069 transitions. Word has length 34 [2020-02-10 20:05:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:21,952 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34069 transitions. [2020-02-10 20:05:21,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34069 transitions. [2020-02-10 20:05:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:21,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:21,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:21,963 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2098705422, now seen corresponding path program 109 times [2020-02-10 20:05:21,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:21,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885682677] [2020-02-10 20:05:21,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:22,646 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:22,798 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:22,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885682677] [2020-02-10 20:05:22,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:22,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:22,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432318863] [2020-02-10 20:05:22,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:22,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:22,810 INFO L87 Difference]: Start difference. First operand 6200 states and 34069 transitions. Second operand 13 states. [2020-02-10 20:05:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:23,167 INFO L93 Difference]: Finished difference Result 11834 states and 58428 transitions. [2020-02-10 20:05:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:23,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:23,197 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 20:05:23,197 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:05:23,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:05:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6214. [2020-02-10 20:05:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:05:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34109 transitions. [2020-02-10 20:05:23,835 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34109 transitions. Word has length 34 [2020-02-10 20:05:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:23,835 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34109 transitions. [2020-02-10 20:05:23,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34109 transitions. [2020-02-10 20:05:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:23,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:23,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:23,847 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1890242668, now seen corresponding path program 110 times [2020-02-10 20:05:23,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:23,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890986204] [2020-02-10 20:05:23,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:24,520 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:24,669 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:24,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890986204] [2020-02-10 20:05:24,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:24,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:24,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421279547] [2020-02-10 20:05:24,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:24,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:24,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:24,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:24,680 INFO L87 Difference]: Start difference. First operand 6214 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:05:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:25,028 INFO L93 Difference]: Finished difference Result 11837 states and 58427 transitions. [2020-02-10 20:05:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:25,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:25,058 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 20:05:25,058 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:05:25,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:05:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6207. [2020-02-10 20:05:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:05:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 20:05:25,702 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 20:05:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:25,702 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 20:05:25,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 20:05:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:25,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:25,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:25,714 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash -720644296, now seen corresponding path program 111 times [2020-02-10 20:05:25,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:25,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273662245] [2020-02-10 20:05:25,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:26,341 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:05:26,482 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:26,627 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:26,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273662245] [2020-02-10 20:05:26,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:26,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479937225] [2020-02-10 20:05:26,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:26,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:26,640 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:05:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:27,050 INFO L93 Difference]: Finished difference Result 11833 states and 58419 transitions. [2020-02-10 20:05:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:27,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:27,081 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:05:27,081 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:05:27,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:05:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 20:05:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:05:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34102 transitions. [2020-02-10 20:05:27,720 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34102 transitions. Word has length 34 [2020-02-10 20:05:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:27,721 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34102 transitions. [2020-02-10 20:05:27,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34102 transitions. [2020-02-10 20:05:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:27,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:27,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:27,732 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 695516012, now seen corresponding path program 112 times [2020-02-10 20:05:27,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223821018] [2020-02-10 20:05:27,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:28,422 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:28,571 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:28,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223821018] [2020-02-10 20:05:28,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:28,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:28,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784402766] [2020-02-10 20:05:28,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:28,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:28,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:28,583 INFO L87 Difference]: Start difference. First operand 6214 states and 34102 transitions. Second operand 13 states. [2020-02-10 20:05:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:28,999 INFO L93 Difference]: Finished difference Result 11835 states and 58416 transitions. [2020-02-10 20:05:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:29,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:29,029 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:05:29,030 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:05:29,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:05:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 20:05:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:05:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34082 transitions. [2020-02-10 20:05:29,672 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34082 transitions. Word has length 34 [2020-02-10 20:05:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:29,672 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34082 transitions. [2020-02-10 20:05:29,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34082 transitions. [2020-02-10 20:05:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:29,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:29,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:29,683 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1453428040, now seen corresponding path program 113 times [2020-02-10 20:05:29,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:29,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387144717] [2020-02-10 20:05:29,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:30,250 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:30,399 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:30,550 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:30,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387144717] [2020-02-10 20:05:30,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:30,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:30,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652029557] [2020-02-10 20:05:30,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:30,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:30,561 INFO L87 Difference]: Start difference. First operand 6207 states and 34082 transitions. Second operand 13 states. [2020-02-10 20:05:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:30,937 INFO L93 Difference]: Finished difference Result 11841 states and 58430 transitions. [2020-02-10 20:05:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:30,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:30,967 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:05:30,967 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:05:30,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:05:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6216. [2020-02-10 20:05:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:05:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34099 transitions. [2020-02-10 20:05:31,741 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34099 transitions. Word has length 34 [2020-02-10 20:05:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:31,741 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34099 transitions. [2020-02-10 20:05:31,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34099 transitions. [2020-02-10 20:05:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:31,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:31,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:31,753 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1471862066, now seen corresponding path program 114 times [2020-02-10 20:05:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:31,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301484295] [2020-02-10 20:05:31,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:32,312 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:32,455 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:32,607 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:32,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301484295] [2020-02-10 20:05:32,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48188373] [2020-02-10 20:05:32,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:32,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:32,619 INFO L87 Difference]: Start difference. First operand 6216 states and 34099 transitions. Second operand 13 states. [2020-02-10 20:05:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:33,000 INFO L93 Difference]: Finished difference Result 11840 states and 58419 transitions. [2020-02-10 20:05:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:33,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:33,030 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:05:33,030 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:05:33,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:05:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6200. [2020-02-10 20:05:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:05:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34063 transitions. [2020-02-10 20:05:33,674 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34063 transitions. Word has length 34 [2020-02-10 20:05:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:33,674 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34063 transitions. [2020-02-10 20:05:33,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34063 transitions. [2020-02-10 20:05:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:33,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:33,685 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1966170974, now seen corresponding path program 115 times [2020-02-10 20:05:33,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:33,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078601748] [2020-02-10 20:05:33,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:34,356 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:34,509 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:34,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078601748] [2020-02-10 20:05:34,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:34,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:34,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750321863] [2020-02-10 20:05:34,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:34,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:34,520 INFO L87 Difference]: Start difference. First operand 6200 states and 34063 transitions. Second operand 13 states. [2020-02-10 20:05:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:34,822 INFO L93 Difference]: Finished difference Result 11827 states and 58403 transitions. [2020-02-10 20:05:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:34,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:34,852 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 20:05:34,852 INFO L226 Difference]: Without dead ends: 11809 [2020-02-10 20:05:34,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2020-02-10 20:05:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 6212. [2020-02-10 20:05:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:05:35,492 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:05:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:35,492 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:05:35,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:05:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:35,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:35,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:35,503 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1436621616, now seen corresponding path program 116 times [2020-02-10 20:05:35,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:35,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54427581] [2020-02-10 20:05:35,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:36,180 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:36,330 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:36,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54427581] [2020-02-10 20:05:36,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:36,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:36,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996894002] [2020-02-10 20:05:36,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:36,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:36,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:36,342 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:05:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:36,628 INFO L93 Difference]: Finished difference Result 11831 states and 58405 transitions. [2020-02-10 20:05:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:36,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:36,658 INFO L225 Difference]: With dead ends: 11831 [2020-02-10 20:05:36,658 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:05:36,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:05:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6206. [2020-02-10 20:05:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34080 transitions. [2020-02-10 20:05:37,388 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34080 transitions. Word has length 34 [2020-02-10 20:05:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:37,389 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34080 transitions. [2020-02-10 20:05:37,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34080 transitions. [2020-02-10 20:05:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:37,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:37,400 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1430941172, now seen corresponding path program 117 times [2020-02-10 20:05:37,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:37,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675900371] [2020-02-10 20:05:37,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:38,068 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:38,214 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:38,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675900371] [2020-02-10 20:05:38,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:38,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:38,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747946803] [2020-02-10 20:05:38,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:38,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:38,226 INFO L87 Difference]: Start difference. First operand 6206 states and 34080 transitions. Second operand 13 states. [2020-02-10 20:05:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:38,559 INFO L93 Difference]: Finished difference Result 11826 states and 58395 transitions. [2020-02-10 20:05:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:38,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:38,588 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:05:38,589 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:05:38,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:05:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6212. [2020-02-10 20:05:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:05:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34091 transitions. [2020-02-10 20:05:39,224 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34091 transitions. Word has length 34 [2020-02-10 20:05:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:39,224 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34091 transitions. [2020-02-10 20:05:39,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34091 transitions. [2020-02-10 20:05:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:39,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:39,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:39,236 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1733227046, now seen corresponding path program 118 times [2020-02-10 20:05:39,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:39,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310121042] [2020-02-10 20:05:39,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:39,900 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:40,047 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:40,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310121042] [2020-02-10 20:05:40,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:40,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:40,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496570574] [2020-02-10 20:05:40,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:40,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:40,059 INFO L87 Difference]: Start difference. First operand 6212 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:05:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:40,354 INFO L93 Difference]: Finished difference Result 11829 states and 58395 transitions. [2020-02-10 20:05:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:40,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:40,384 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:05:40,384 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:05:40,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:05:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6206. [2020-02-10 20:05:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:05:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34074 transitions. [2020-02-10 20:05:41,024 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34074 transitions. Word has length 34 [2020-02-10 20:05:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:41,025 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34074 transitions. [2020-02-10 20:05:41,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34074 transitions. [2020-02-10 20:05:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:41,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:41,036 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:41,037 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -655694114, now seen corresponding path program 119 times [2020-02-10 20:05:41,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:41,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965929014] [2020-02-10 20:05:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:41,568 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:41,713 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:41,859 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:41,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 20:05:41,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965929014] [2020-02-10 20:05:41,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:41,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:41,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656310078] [2020-02-10 20:05:41,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:41,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:41,871 INFO L87 Difference]: Start difference. First operand 6206 states and 34074 transitions. Second operand 13 states. [2020-02-10 20:05:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:42,167 INFO L93 Difference]: Finished difference Result 11837 states and 58414 transitions. [2020-02-10 20:05:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:42,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:42,210 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 20:05:42,210 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:05:42,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:05:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6215. [2020-02-10 20:05:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:05:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34091 transitions. [2020-02-10 20:05:42,924 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34091 transitions. Word has length 34 [2020-02-10 20:05:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:42,925 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34091 transitions. [2020-02-10 20:05:42,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34091 transitions. [2020-02-10 20:05:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:42,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:42,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:42,936 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash -674128140, now seen corresponding path program 120 times [2020-02-10 20:05:42,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:42,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435480993] [2020-02-10 20:05:42,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:43,458 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:43,603 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:05:43,750 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:05:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435480993] [2020-02-10 20:05:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842411752] [2020-02-10 20:05:43,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:43,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:43,761 INFO L87 Difference]: Start difference. First operand 6215 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:05:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:44,103 INFO L93 Difference]: Finished difference Result 11836 states and 58403 transitions. [2020-02-10 20:05:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:44,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:44,133 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 20:05:44,133 INFO L226 Difference]: Without dead ends: 11785 [2020-02-10 20:05:44,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2020-02-10 20:05:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 6185. [2020-02-10 20:05:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 20:05:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34029 transitions. [2020-02-10 20:05:44,776 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34029 transitions. Word has length 34 [2020-02-10 20:05:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:44,776 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34029 transitions. [2020-02-10 20:05:44,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34029 transitions. [2020-02-10 20:05:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:44,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:44,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:44,787 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -107252240, now seen corresponding path program 121 times [2020-02-10 20:05:44,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:44,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647821097] [2020-02-10 20:05:44,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:45,354 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:05:45,509 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:05:45,656 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:05:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:45,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647821097] [2020-02-10 20:05:45,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:45,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:45,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946851368] [2020-02-10 20:05:45,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:45,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:45,668 INFO L87 Difference]: Start difference. First operand 6185 states and 34029 transitions. Second operand 13 states. [2020-02-10 20:05:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:45,974 INFO L93 Difference]: Finished difference Result 11918 states and 58698 transitions. [2020-02-10 20:05:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:45,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:46,003 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:05:46,004 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 20:05:46,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 20:05:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6228. [2020-02-10 20:05:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:05:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 20:05:46,646 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 20:05:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:46,647 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 20:05:46,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 20:05:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:46,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:46,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:46,658 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -743719094, now seen corresponding path program 122 times [2020-02-10 20:05:46,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:46,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161371535] [2020-02-10 20:05:46,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:47,217 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:05:47,367 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:47,519 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:47,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161371535] [2020-02-10 20:05:47,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:47,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:47,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610376544] [2020-02-10 20:05:47,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:47,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:47,532 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:05:47,910 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:05:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:47,938 INFO L93 Difference]: Finished difference Result 11916 states and 58684 transitions. [2020-02-10 20:05:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:47,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:47,971 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 20:05:47,971 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 20:05:47,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 20:05:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6216. [2020-02-10 20:05:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:05:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34151 transitions. [2020-02-10 20:05:48,613 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34151 transitions. Word has length 34 [2020-02-10 20:05:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:48,613 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34151 transitions. [2020-02-10 20:05:48,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34151 transitions. [2020-02-10 20:05:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:48,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:48,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:48,625 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1656002464, now seen corresponding path program 123 times [2020-02-10 20:05:48,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:48,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683162950] [2020-02-10 20:05:48,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:49,181 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:05:49,326 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:05:49,479 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:05:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:49,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683162950] [2020-02-10 20:05:49,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:49,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:49,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014666937] [2020-02-10 20:05:49,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:49,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:49,491 INFO L87 Difference]: Start difference. First operand 6216 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:05:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:49,907 INFO L93 Difference]: Finished difference Result 11906 states and 58664 transitions. [2020-02-10 20:05:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:49,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:49,938 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:05:49,938 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:05:49,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:05:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6224. [2020-02-10 20:05:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:05:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34166 transitions. [2020-02-10 20:05:50,576 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34166 transitions. Word has length 34 [2020-02-10 20:05:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:50,576 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34166 transitions. [2020-02-10 20:05:50,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34166 transitions. [2020-02-10 20:05:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:50,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05: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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:50,587 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 671066180, now seen corresponding path program 124 times [2020-02-10 20:05:50,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:50,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268110752] [2020-02-10 20:05:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:51,161 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:05:51,307 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:05:51,459 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:05:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:51,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268110752] [2020-02-10 20:05:51,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:51,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:51,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68846381] [2020-02-10 20:05:51,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:51,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:51,471 INFO L87 Difference]: Start difference. First operand 6224 states and 34166 transitions. Second operand 13 states. [2020-02-10 20:05:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:51,870 INFO L93 Difference]: Finished difference Result 11911 states and 58666 transitions. [2020-02-10 20:05:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:51,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:51,900 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:05:51,900 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:05:51,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:05:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6216. [2020-02-10 20:05:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:05:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34143 transitions. [2020-02-10 20:05:52,542 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34143 transitions. Word has length 34 [2020-02-10 20:05:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:52,542 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34143 transitions. [2020-02-10 20:05:52,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34143 transitions. [2020-02-10 20:05:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:52,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:52,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:52,553 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -894600826, now seen corresponding path program 125 times [2020-02-10 20:05:52,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:52,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010549905] [2020-02-10 20:05:52,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:53,346 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:05:53,498 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:53,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010549905] [2020-02-10 20:05:53,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:53,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:53,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511111868] [2020-02-10 20:05:53,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:53,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:53,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:53,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:53,510 INFO L87 Difference]: Start difference. First operand 6216 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:05:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:53,837 INFO L93 Difference]: Finished difference Result 11903 states and 58651 transitions. [2020-02-10 20:05:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:53,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:53,867 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 20:05:53,868 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 20:05:53,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 20:05:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6223. [2020-02-10 20:05:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:05:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34156 transitions. [2020-02-10 20:05:54,505 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34156 transitions. Word has length 34 [2020-02-10 20:05:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:54,505 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34156 transitions. [2020-02-10 20:05:54,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34156 transitions. [2020-02-10 20:05:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:54,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:54,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:54,520 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1103063580, now seen corresponding path program 126 times [2020-02-10 20:05:54,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:54,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001990460] [2020-02-10 20:05:54,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:55,232 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:55,386 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:55,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 20:05:55,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001990460] [2020-02-10 20:05:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:55,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:55,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139366639] [2020-02-10 20:05:55,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:55,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:55,398 INFO L87 Difference]: Start difference. First operand 6223 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:05:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:55,774 INFO L93 Difference]: Finished difference Result 11906 states and 58650 transitions. [2020-02-10 20:05:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:55,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:55,803 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:05:55,803 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:05:55,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:05:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6207. [2020-02-10 20:05:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:05:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34119 transitions. [2020-02-10 20:05:56,446 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34119 transitions. Word has length 34 [2020-02-10 20:05:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:56,446 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34119 transitions. [2020-02-10 20:05:56,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34119 transitions. [2020-02-10 20:05:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:56,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:56,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:56,457 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 214145790, now seen corresponding path program 127 times [2020-02-10 20:05:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538574996] [2020-02-10 20:05:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:57,035 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:05:57,186 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:05:57,337 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:05:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:57,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538574996] [2020-02-10 20:05:57,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:57,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:57,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383423548] [2020-02-10 20:05:57,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:57,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:57,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:57,349 INFO L87 Difference]: Start difference. First operand 6207 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:05:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:57,627 INFO L93 Difference]: Finished difference Result 11927 states and 58714 transitions. [2020-02-10 20:05:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:57,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:57,657 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 20:05:57,657 INFO L226 Difference]: Without dead ends: 11903 [2020-02-10 20:05:57,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:05:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11903 states. [2020-02-10 20:05:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11903 to 6231. [2020-02-10 20:05:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:05:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34181 transitions. [2020-02-10 20:05:58,298 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34181 transitions. Word has length 34 [2020-02-10 20:05:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:58,298 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34181 transitions. [2020-02-10 20:05:58,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:05:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34181 transitions. [2020-02-10 20:05:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:05:58,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:58,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:58,309 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -422321064, now seen corresponding path program 128 times [2020-02-10 20:05:58,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:58,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996385501] [2020-02-10 20:05:58,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:58,732 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:05:58,976 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:05:59,123 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:05:59,272 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:05:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996385501] [2020-02-10 20:05:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:59,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:05:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323997489] [2020-02-10 20:05:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:05:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:05:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:59,284 INFO L87 Difference]: Start difference. First operand 6231 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:05:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:59,593 INFO L93 Difference]: Finished difference Result 11925 states and 58700 transitions. [2020-02-10 20:05:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:05:59,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:05:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:59,623 INFO L225 Difference]: With dead ends: 11925 [2020-02-10 20:05:59,623 INFO L226 Difference]: Without dead ends: 11891 [2020-02-10 20:05:59,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2020-02-10 20:06:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 6219. [2020-02-10 20:06:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:06:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34149 transitions. [2020-02-10 20:06:00,266 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34149 transitions. Word has length 34 [2020-02-10 20:06:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:00,266 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34149 transitions. [2020-02-10 20:06:00,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34149 transitions. [2020-02-10 20:06:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:00,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:00,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:00,277 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1142165220, now seen corresponding path program 129 times [2020-02-10 20:06:00,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:00,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120282666] [2020-02-10 20:06:00,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:00,838 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:00,985 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:01,135 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:01,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120282666] [2020-02-10 20:06:01,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:01,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:01,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73826350] [2020-02-10 20:06:01,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:01,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:01,147 INFO L87 Difference]: Start difference. First operand 6219 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:06:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:01,537 INFO L93 Difference]: Finished difference Result 11924 states and 58697 transitions. [2020-02-10 20:06:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:01,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:01,568 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 20:06:01,569 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:06:01,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:06:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6229. [2020-02-10 20:06:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2020-02-10 20:06:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 34167 transitions. [2020-02-10 20:06:02,204 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 34167 transitions. Word has length 34 [2020-02-10 20:06:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:02,204 INFO L479 AbstractCegarLoop]: Abstraction has 6229 states and 34167 transitions. [2020-02-10 20:06:02,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 34167 transitions. [2020-02-10 20:06:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:02,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:02,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:02,215 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash -555079724, now seen corresponding path program 130 times [2020-02-10 20:06:02,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:02,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135727464] [2020-02-10 20:06:02,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:02,914 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:06:03,055 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:03,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 20:06:03,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135727464] [2020-02-10 20:06:03,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:03,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:03,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204912335] [2020-02-10 20:06:03,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:03,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:03,068 INFO L87 Difference]: Start difference. First operand 6229 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:06:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:03,399 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 20:06:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:03,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:03,429 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:06:03,429 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:06:03,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:06:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6219. [2020-02-10 20:06:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:06:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34139 transitions. [2020-02-10 20:06:04,207 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34139 transitions. Word has length 34 [2020-02-10 20:06:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:04,207 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34139 transitions. [2020-02-10 20:06:04,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34139 transitions. [2020-02-10 20:06:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:04,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:04,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:04,219 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:04,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2044904924, now seen corresponding path program 131 times [2020-02-10 20:06:04,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:04,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302740032] [2020-02-10 20:06:04,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:04,788 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:04,933 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:05,082 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:05,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302740032] [2020-02-10 20:06:05,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:05,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:05,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609400169] [2020-02-10 20:06:05,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:05,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:05,095 INFO L87 Difference]: Start difference. First operand 6219 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:06:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:05,493 INFO L93 Difference]: Finished difference Result 11919 states and 58679 transitions. [2020-02-10 20:06:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:05,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:05,523 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 20:06:05,523 INFO L226 Difference]: Without dead ends: 11897 [2020-02-10 20:06:05,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11897 states. [2020-02-10 20:06:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11897 to 6228. [2020-02-10 20:06:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:06:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34156 transitions. [2020-02-10 20:06:06,162 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34156 transitions. Word has length 34 [2020-02-10 20:06:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:06,162 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34156 transitions. [2020-02-10 20:06:06,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34156 transitions. [2020-02-10 20:06:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:06,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:06,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:06,173 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1189284282, now seen corresponding path program 132 times [2020-02-10 20:06:06,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:06,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143204052] [2020-02-10 20:06:06,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:06,745 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:06,888 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:07,033 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:07,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143204052] [2020-02-10 20:06:07,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:07,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:07,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513530766] [2020-02-10 20:06:07,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:07,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:07,045 INFO L87 Difference]: Start difference. First operand 6228 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:06:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:07,381 INFO L93 Difference]: Finished difference Result 11918 states and 58668 transitions. [2020-02-10 20:06:07,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:07,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:07,414 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:06:07,414 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:06:07,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:06:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6207. [2020-02-10 20:06:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:06:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34109 transitions. [2020-02-10 20:06:08,056 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34109 transitions. Word has length 34 [2020-02-10 20:06:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:08,056 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34109 transitions. [2020-02-10 20:06:08,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34109 transitions. [2020-02-10 20:06:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:08,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:08,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:08,067 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 359833722, now seen corresponding path program 133 times [2020-02-10 20:06:08,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:08,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046255595] [2020-02-10 20:06:08,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:08,635 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:06:08,776 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:08,929 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:08,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046255595] [2020-02-10 20:06:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:08,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:08,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800748211] [2020-02-10 20:06:08,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:08,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:08,941 INFO L87 Difference]: Start difference. First operand 6207 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:06:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:09,312 INFO L93 Difference]: Finished difference Result 11902 states and 58646 transitions. [2020-02-10 20:06:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:09,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:09,342 INFO L225 Difference]: With dead ends: 11902 [2020-02-10 20:06:09,342 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 20:06:09,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 20:06:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6223. [2020-02-10 20:06:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:06:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 20:06:10,069 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 20:06:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:10,069 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 20:06:10,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 20:06:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:10,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:10,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:10,080 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash -625102562, now seen corresponding path program 134 times [2020-02-10 20:06:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:10,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323744952] [2020-02-10 20:06:10,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:10,633 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:06:10,781 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:10,930 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:10,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323744952] [2020-02-10 20:06:10,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:10,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:10,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956275218] [2020-02-10 20:06:10,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:10,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:10,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:10,942 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:06:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:11,335 INFO L93 Difference]: Finished difference Result 11907 states and 58648 transitions. [2020-02-10 20:06:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:11,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:11,365 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 20:06:11,365 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:06:11,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:06:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6215. [2020-02-10 20:06:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:06:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 20:06:12,002 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 20:06:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:12,002 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 20:06:12,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 20:06:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:12,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:12,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:12,013 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash -715151990, now seen corresponding path program 135 times [2020-02-10 20:06:12,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:12,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426488450] [2020-02-10 20:06:12,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:12,702 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:12,851 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:12,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426488450] [2020-02-10 20:06:12,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:12,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:12,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24108907] [2020-02-10 20:06:12,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:12,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:12,862 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:06:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:13,303 INFO L93 Difference]: Finished difference Result 11898 states and 58631 transitions. [2020-02-10 20:06:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:13,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:13,334 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 20:06:13,334 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:06:13,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:06:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6222. [2020-02-10 20:06:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:06:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 20:06:13,972 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 20:06:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:13,973 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 20:06:13,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 20:06:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:13,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:13,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:13,984 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 701008318, now seen corresponding path program 136 times [2020-02-10 20:06:13,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:13,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760137087] [2020-02-10 20:06:13,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:14,684 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:06:14,830 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:14,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760137087] [2020-02-10 20:06:14,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:14,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:14,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100817308] [2020-02-10 20:06:14,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:14,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:14,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:14,842 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:06:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:15,328 INFO L93 Difference]: Finished difference Result 11900 states and 58628 transitions. [2020-02-10 20:06:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:15,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:15,358 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:06:15,359 INFO L226 Difference]: Without dead ends: 11872 [2020-02-10 20:06:15,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2020-02-10 20:06:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 6215. [2020-02-10 20:06:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:06:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34124 transitions. [2020-02-10 20:06:16,072 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34124 transitions. Word has length 34 [2020-02-10 20:06:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:16,072 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34124 transitions. [2020-02-10 20:06:16,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34124 transitions. [2020-02-10 20:06:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:16,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:16,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:16,084 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 326194026, now seen corresponding path program 137 times [2020-02-10 20:06:16,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:16,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26437860] [2020-02-10 20:06:16,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:16,788 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:16,939 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:16,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26437860] [2020-02-10 20:06:16,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:16,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:16,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310899272] [2020-02-10 20:06:16,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:16,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:16,951 INFO L87 Difference]: Start difference. First operand 6215 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:06:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:17,198 INFO L93 Difference]: Finished difference Result 11911 states and 58650 transitions. [2020-02-10 20:06:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:17,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:17,229 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:06:17,229 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:06:17,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:06:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 20:06:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:06:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34142 transitions. [2020-02-10 20:06:17,867 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34142 transitions. Word has length 34 [2020-02-10 20:06:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:17,867 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34142 transitions. [2020-02-10 20:06:17,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34142 transitions. [2020-02-10 20:06:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:17,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:17,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:17,879 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash -927021958, now seen corresponding path program 138 times [2020-02-10 20:06:17,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:17,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377482260] [2020-02-10 20:06:17,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:18,442 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:18,590 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:06:18,743 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:06:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:18,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377482260] [2020-02-10 20:06:18,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:18,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:18,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868410331] [2020-02-10 20:06:18,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:18,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:18,755 INFO L87 Difference]: Start difference. First operand 6225 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:06:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:19,054 INFO L93 Difference]: Finished difference Result 11908 states and 58635 transitions. [2020-02-10 20:06:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:19,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:19,083 INFO L225 Difference]: With dead ends: 11908 [2020-02-10 20:06:19,084 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:06:19,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:06:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6207. [2020-02-10 20:06:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:06:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34101 transitions. [2020-02-10 20:06:19,726 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34101 transitions. Word has length 34 [2020-02-10 20:06:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:19,726 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34101 transitions. [2020-02-10 20:06:19,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34101 transitions. [2020-02-10 20:06:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:19,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:19,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:19,738 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 344907066, now seen corresponding path program 139 times [2020-02-10 20:06:19,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:19,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564779769] [2020-02-10 20:06:19,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:20,443 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:06:20,591 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564779769] [2020-02-10 20:06:20,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:20,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:20,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510482371] [2020-02-10 20:06:20,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:20,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:20,603 INFO L87 Difference]: Start difference. First operand 6207 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:06:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:20,896 INFO L93 Difference]: Finished difference Result 11894 states and 58623 transitions. [2020-02-10 20:06:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:20,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:20,926 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:06:20,926 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:06:20,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:06:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6221. [2020-02-10 20:06:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:06:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34141 transitions. [2020-02-10 20:06:21,643 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34141 transitions. Word has length 34 [2020-02-10 20:06:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:21,643 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34141 transitions. [2020-02-10 20:06:21,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34141 transitions. [2020-02-10 20:06:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:21,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:21,654 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash 136444312, now seen corresponding path program 140 times [2020-02-10 20:06:21,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:21,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403007408] [2020-02-10 20:06:21,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:22,208 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:06:22,353 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:22,504 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:22,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403007408] [2020-02-10 20:06:22,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:22,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:22,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198059493] [2020-02-10 20:06:22,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:22,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:22,515 INFO L87 Difference]: Start difference. First operand 6221 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:06:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:22,815 INFO L93 Difference]: Finished difference Result 11897 states and 58622 transitions. [2020-02-10 20:06:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:22,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:22,845 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:06:22,845 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:06:22,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:06:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 20:06:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:06:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34121 transitions. [2020-02-10 20:06:23,484 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34121 transitions. Word has length 34 [2020-02-10 20:06:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:23,484 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34121 transitions. [2020-02-10 20:06:23,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34121 transitions. [2020-02-10 20:06:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:23,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:23,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:23,495 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1820524644, now seen corresponding path program 141 times [2020-02-10 20:06:23,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:23,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027969113] [2020-02-10 20:06:23,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:24,192 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:24,341 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:24,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027969113] [2020-02-10 20:06:24,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:24,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:24,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492777042] [2020-02-10 20:06:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:24,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:24,353 INFO L87 Difference]: Start difference. First operand 6214 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:06:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:24,720 INFO L93 Difference]: Finished difference Result 11893 states and 58614 transitions. [2020-02-10 20:06:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:24,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:24,751 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:06:24,751 INFO L226 Difference]: Without dead ends: 11874 [2020-02-10 20:06:24,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11874 states. [2020-02-10 20:06:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11874 to 6221. [2020-02-10 20:06:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:06:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34134 transitions. [2020-02-10 20:06:25,389 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34134 transitions. Word has length 34 [2020-02-10 20:06:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:25,389 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34134 transitions. [2020-02-10 20:06:25,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34134 transitions. [2020-02-10 20:06:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:25,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:25,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:25,400 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1058282344, now seen corresponding path program 142 times [2020-02-10 20:06:25,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:25,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007984964] [2020-02-10 20:06:25,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:25,955 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:06:26,102 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:26,245 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:26,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007984964] [2020-02-10 20:06:26,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:26,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:26,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833837284] [2020-02-10 20:06:26,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:26,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:26,258 INFO L87 Difference]: Start difference. First operand 6221 states and 34134 transitions. Second operand 13 states. [2020-02-10 20:06:26,668 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-02-10 20:06:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:26,696 INFO L93 Difference]: Finished difference Result 11895 states and 58611 transitions. [2020-02-10 20:06:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:26,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:26,728 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:06:26,729 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:06:26,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:06:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 20:06:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:06:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34114 transitions. [2020-02-10 20:06:27,363 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34114 transitions. Word has length 34 [2020-02-10 20:06:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:27,363 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34114 transitions. [2020-02-10 20:06:27,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34114 transitions. [2020-02-10 20:06:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:27,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:27,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:27,375 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1087740900, now seen corresponding path program 143 times [2020-02-10 20:06:27,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:27,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941031273] [2020-02-10 20:06:27,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:27,928 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:28,075 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:28,222 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:28,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941031273] [2020-02-10 20:06:28,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:28,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:28,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266947402] [2020-02-10 20:06:28,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:28,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:28,234 INFO L87 Difference]: Start difference. First operand 6214 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:06:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:28,616 INFO L93 Difference]: Finished difference Result 11901 states and 58625 transitions. [2020-02-10 20:06:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:28,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:28,647 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:06:28,647 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:06:28,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:06:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6223. [2020-02-10 20:06:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:06:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34131 transitions. [2020-02-10 20:06:29,287 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34131 transitions. Word has length 34 [2020-02-10 20:06:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:29,287 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34131 transitions. [2020-02-10 20:06:29,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34131 transitions. [2020-02-10 20:06:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:29,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:29,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:29,299 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1069306874, now seen corresponding path program 144 times [2020-02-10 20:06:29,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:29,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522883999] [2020-02-10 20:06:29,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:29,863 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:30,009 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:30,153 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:30,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522883999] [2020-02-10 20:06:30,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:30,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:30,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274867472] [2020-02-10 20:06:30,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:30,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:30,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:30,167 INFO L87 Difference]: Start difference. First operand 6223 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:06:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:30,471 INFO L93 Difference]: Finished difference Result 11900 states and 58614 transitions. [2020-02-10 20:06:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:30,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:30,501 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:06:30,501 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:06:30,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:06:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6197. [2020-02-10 20:06:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:06:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34075 transitions. [2020-02-10 20:06:31,141 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34075 transitions. Word has length 34 [2020-02-10 20:06:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:31,141 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34075 transitions. [2020-02-10 20:06:31,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34075 transitions. [2020-02-10 20:06:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:31,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:31,153 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash -990534336, now seen corresponding path program 145 times [2020-02-10 20:06:31,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:31,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230447156] [2020-02-10 20:06:31,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:31,706 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:31,854 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:32,003 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:32,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230447156] [2020-02-10 20:06:32,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:32,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:32,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436932224] [2020-02-10 20:06:32,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:32,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:32,015 INFO L87 Difference]: Start difference. First operand 6197 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:06:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:32,450 INFO L93 Difference]: Finished difference Result 11912 states and 58673 transitions. [2020-02-10 20:06:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:32,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:32,481 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 20:06:32,481 INFO L226 Difference]: Without dead ends: 11888 [2020-02-10 20:06:32,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2020-02-10 20:06:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 6227. [2020-02-10 20:06:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:06:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34169 transitions. [2020-02-10 20:06:33,123 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34169 transitions. Word has length 34 [2020-02-10 20:06:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:33,124 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34169 transitions. [2020-02-10 20:06:33,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34169 transitions. [2020-02-10 20:06:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:33,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:33,135 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1627001190, now seen corresponding path program 146 times [2020-02-10 20:06:33,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:33,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800885712] [2020-02-10 20:06:33,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:33,692 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:33,838 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:33,986 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:33,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800885712] [2020-02-10 20:06:33,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:33,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:33,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432610644] [2020-02-10 20:06:33,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:33,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:33,999 INFO L87 Difference]: Start difference. First operand 6227 states and 34169 transitions. Second operand 13 states. [2020-02-10 20:06:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:34,313 INFO L93 Difference]: Finished difference Result 11910 states and 58659 transitions. [2020-02-10 20:06:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:34,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:34,344 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:06:34,344 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:06:34,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:06:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6215. [2020-02-10 20:06:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:06:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34139 transitions. [2020-02-10 20:06:34,986 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34139 transitions. Word has length 34 [2020-02-10 20:06:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:34,986 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34139 transitions. [2020-02-10 20:06:34,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34139 transitions. [2020-02-10 20:06:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:34,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:34,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:34,998 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash 772720368, now seen corresponding path program 147 times [2020-02-10 20:06:34,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:34,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458410658] [2020-02-10 20:06:34,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:35,554 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:06:35,705 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:35,851 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:35,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458410658] [2020-02-10 20:06:35,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:35,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:35,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405281255] [2020-02-10 20:06:35,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:35,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:35,864 INFO L87 Difference]: Start difference. First operand 6215 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:06:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:36,278 INFO L93 Difference]: Finished difference Result 11900 states and 58639 transitions. [2020-02-10 20:06:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:36,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:36,309 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:06:36,309 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 20:06:36,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 20:06:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6223. [2020-02-10 20:06:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:06:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 20:06:36,949 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 20:06:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:36,949 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 20:06:36,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 20:06:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:36,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:36,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:36,961 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash -212215916, now seen corresponding path program 148 times [2020-02-10 20:06:36,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:36,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942539048] [2020-02-10 20:06:36,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:37,525 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:06:37,674 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:37,922 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:37,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942539048] [2020-02-10 20:06:37,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:37,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:37,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031494028] [2020-02-10 20:06:37,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:37,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:37,934 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:06:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:38,187 INFO L93 Difference]: Finished difference Result 11905 states and 58641 transitions. [2020-02-10 20:06:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:38,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:38,224 INFO L225 Difference]: With dead ends: 11905 [2020-02-10 20:06:38,225 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:06:38,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:06:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6215. [2020-02-10 20:06:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:06:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 20:06:38,865 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 20:06:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:38,865 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 20:06:38,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 20:06:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:38,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:38,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:38,877 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1777882922, now seen corresponding path program 149 times [2020-02-10 20:06:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:38,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024301148] [2020-02-10 20:06:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:39,564 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:06:39,714 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:39,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024301148] [2020-02-10 20:06:39,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:39,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:39,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799195253] [2020-02-10 20:06:39,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:39,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:39,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:39,726 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:06:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:40,044 INFO L93 Difference]: Finished difference Result 11897 states and 58626 transitions. [2020-02-10 20:06:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:40,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:40,073 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:06:40,073 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 20:06:40,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 20:06:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6222. [2020-02-10 20:06:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:06:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 20:06:40,717 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 20:06:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:40,717 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 20:06:40,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 20:06:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:40,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:40,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:40,728 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1986345676, now seen corresponding path program 150 times [2020-02-10 20:06:40,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:40,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339411019] [2020-02-10 20:06:40,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:41,441 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:41,593 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339411019] [2020-02-10 20:06:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:41,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:41,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124172277] [2020-02-10 20:06:41,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:41,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:41,606 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:06:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:41,927 INFO L93 Difference]: Finished difference Result 11900 states and 58625 transitions. [2020-02-10 20:06:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:41,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:41,957 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:06:41,957 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:06:41,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:42,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:06:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6206. [2020-02-10 20:06:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:06:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34107 transitions. [2020-02-10 20:06:42,595 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34107 transitions. Word has length 34 [2020-02-10 20:06:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:42,595 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34107 transitions. [2020-02-10 20:06:42,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34107 transitions. [2020-02-10 20:06:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:42,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:42,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:42,607 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2087042548, now seen corresponding path program 151 times [2020-02-10 20:06:42,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:42,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098979714] [2020-02-10 20:06:42,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:43,179 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:06:43,335 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:06:43,587 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:43,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098979714] [2020-02-10 20:06:43,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:43,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:43,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390905660] [2020-02-10 20:06:43,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:43,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:43,600 INFO L87 Difference]: Start difference. First operand 6206 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:06:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:43,925 INFO L93 Difference]: Finished difference Result 11916 states and 58676 transitions. [2020-02-10 20:06:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:43,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:43,955 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 20:06:43,955 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 20:06:43,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 20:06:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6228. [2020-02-10 20:06:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:06:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34164 transitions. [2020-02-10 20:06:44,599 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34164 transitions. Word has length 34 [2020-02-10 20:06:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:44,600 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34164 transitions. [2020-02-10 20:06:44,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34164 transitions. [2020-02-10 20:06:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:44,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:44,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:44,611 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1450575694, now seen corresponding path program 152 times [2020-02-10 20:06:44,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:44,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432247974] [2020-02-10 20:06:44,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:45,187 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:06:45,334 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:06:45,487 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:06:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:45,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432247974] [2020-02-10 20:06:45,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042681198] [2020-02-10 20:06:45,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:45,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:45,500 INFO L87 Difference]: Start difference. First operand 6228 states and 34164 transitions. Second operand 13 states. [2020-02-10 20:06:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:45,903 INFO L93 Difference]: Finished difference Result 11914 states and 58662 transitions. [2020-02-10 20:06:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:45,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:45,933 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:06:45,933 INFO L226 Difference]: Without dead ends: 11880 [2020-02-10 20:06:45,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11880 states. [2020-02-10 20:06:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11880 to 6216. [2020-02-10 20:06:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:06:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 20:06:46,571 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 20:06:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:46,571 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 20:06:46,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 20:06:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:46,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:46,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:46,582 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1733424308, now seen corresponding path program 153 times [2020-02-10 20:06:46,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067865020] [2020-02-10 20:06:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:47,159 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:06:47,312 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:06:47,464 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:47,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067865020] [2020-02-10 20:06:47,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:47,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:47,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429404221] [2020-02-10 20:06:47,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:47,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:47,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:47,477 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:06:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:47,771 INFO L93 Difference]: Finished difference Result 11911 states and 58655 transitions. [2020-02-10 20:06:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:47,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:47,804 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:06:47,804 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:06:47,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:06:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 20:06:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:06:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34149 transitions. [2020-02-10 20:06:48,448 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34149 transitions. Word has length 34 [2020-02-10 20:06:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:48,448 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34149 transitions. [2020-02-10 20:06:48,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34149 transitions. [2020-02-10 20:06:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:48,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:48,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:48,459 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash 672646218, now seen corresponding path program 154 times [2020-02-10 20:06:48,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:48,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094083695] [2020-02-10 20:06:48,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:49,261 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:06:49,408 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:06:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:49,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094083695] [2020-02-10 20:06:49,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:49,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:49,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969727636] [2020-02-10 20:06:49,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:49,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:49,421 INFO L87 Difference]: Start difference. First operand 6225 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:06:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:49,800 INFO L93 Difference]: Finished difference Result 11907 states and 58639 transitions. [2020-02-10 20:06:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:49,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:49,830 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 20:06:49,830 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 20:06:49,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 20:06:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6216. [2020-02-10 20:06:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:06:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34124 transitions. [2020-02-10 20:06:50,469 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34124 transitions. Word has length 34 [2020-02-10 20:06:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:50,469 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34124 transitions. [2020-02-10 20:06:50,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34124 transitions. [2020-02-10 20:06:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:50,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:50,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:50,485 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1453645836, now seen corresponding path program 155 times [2020-02-10 20:06:50,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:50,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29137722] [2020-02-10 20:06:50,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:51,186 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:06:51,339 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:06:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:51,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29137722] [2020-02-10 20:06:51,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:51,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:51,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914975644] [2020-02-10 20:06:51,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:51,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:51,352 INFO L87 Difference]: Start difference. First operand 6216 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:06:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:51,693 INFO L93 Difference]: Finished difference Result 11906 states and 58638 transitions. [2020-02-10 20:06:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:51,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:51,723 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:06:51,723 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 20:06:51,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 20:06:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6224. [2020-02-10 20:06:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:06:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34139 transitions. [2020-02-10 20:06:52,365 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34139 transitions. Word has length 34 [2020-02-10 20:06:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:52,365 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34139 transitions. [2020-02-10 20:06:52,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34139 transitions. [2020-02-10 20:06:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:52,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:52,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:52,376 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1877957072, now seen corresponding path program 156 times [2020-02-10 20:06:52,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:52,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630179395] [2020-02-10 20:06:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:53,076 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:06:53,225 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:06:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:53,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630179395] [2020-02-10 20:06:53,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:53,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:53,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457982198] [2020-02-10 20:06:53,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:53,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:53,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:53,238 INFO L87 Difference]: Start difference. First operand 6224 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:06:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:53,615 INFO L93 Difference]: Finished difference Result 11904 states and 58626 transitions. [2020-02-10 20:06:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:53,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:53,644 INFO L225 Difference]: With dead ends: 11904 [2020-02-10 20:06:53,644 INFO L226 Difference]: Without dead ends: 11866 [2020-02-10 20:06:53,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11866 states. [2020-02-10 20:06:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11866 to 6206. [2020-02-10 20:06:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:06:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 20:06:54,282 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 20:06:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:54,282 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 20:06:54,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 20:06:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:54,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:54,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:54,293 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1599510480, now seen corresponding path program 157 times [2020-02-10 20:06:54,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:54,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213845306] [2020-02-10 20:06:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:54,974 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:06:55,120 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:55,263 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:55,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213845306] [2020-02-10 20:06:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:55,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:55,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745506590] [2020-02-10 20:06:55,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:55,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:55,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:55,278 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:06:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:55,852 INFO L93 Difference]: Finished difference Result 11894 states and 58617 transitions. [2020-02-10 20:06:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:55,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:55,882 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:06:55,882 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:06:55,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:06:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6222. [2020-02-10 20:06:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:06:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34143 transitions. [2020-02-10 20:06:56,522 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34143 transitions. Word has length 34 [2020-02-10 20:06:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:56,522 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34143 transitions. [2020-02-10 20:06:56,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34143 transitions. [2020-02-10 20:06:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:56,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:56,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:56,533 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1710520532, now seen corresponding path program 158 times [2020-02-10 20:06:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:56,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235598193] [2020-02-10 20:06:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:57,089 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:06:57,240 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:06:57,392 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:57,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235598193] [2020-02-10 20:06:57,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:57,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:57,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767608170] [2020-02-10 20:06:57,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:57,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:57,404 INFO L87 Difference]: Start difference. First operand 6222 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:06:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:57,653 INFO L93 Difference]: Finished difference Result 11899 states and 58619 transitions. [2020-02-10 20:06:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:57,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:57,682 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 20:06:57,682 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:06:57,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:06:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:06:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 20:06:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:06:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34120 transitions. [2020-02-10 20:06:58,322 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34120 transitions. Word has length 34 [2020-02-10 20:06:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:58,322 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34120 transitions. [2020-02-10 20:06:58,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:06:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34120 transitions. [2020-02-10 20:06:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:06:58,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:58,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:58,334 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -123892902, now seen corresponding path program 159 times [2020-02-10 20:06:58,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:58,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910882278] [2020-02-10 20:06:58,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:58,882 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:06:59,028 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:06:59,177 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:06:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:59,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910882278] [2020-02-10 20:06:59,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:59,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:06:59,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980215942] [2020-02-10 20:06:59,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:06:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:06:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:59,189 INFO L87 Difference]: Start difference. First operand 6214 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:06:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:59,506 INFO L93 Difference]: Finished difference Result 11889 states and 58600 transitions. [2020-02-10 20:06:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:06:59,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:06:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:59,536 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:06:59,537 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 20:06:59,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 20:07:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6221. [2020-02-10 20:07:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:07:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34133 transitions. [2020-02-10 20:07:00,187 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34133 transitions. Word has length 34 [2020-02-10 20:07:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:00,187 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34133 transitions. [2020-02-10 20:07:00,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34133 transitions. [2020-02-10 20:07:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:00,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:00,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:00,198 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1176487028, now seen corresponding path program 160 times [2020-02-10 20:07:00,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:00,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632680354] [2020-02-10 20:07:00,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:00,729 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 20:07:00,850 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:07:00,993 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:07:01,141 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:01,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632680354] [2020-02-10 20:07:01,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:01,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:01,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804184711] [2020-02-10 20:07:01,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:01,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:01,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:01,153 INFO L87 Difference]: Start difference. First operand 6221 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:07:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:01,446 INFO L93 Difference]: Finished difference Result 11890 states and 58595 transitions. [2020-02-10 20:07:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:01,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:01,476 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:07:01,476 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:07:01,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:07:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6214. [2020-02-10 20:07:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:07:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34113 transitions. [2020-02-10 20:07:02,112 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34113 transitions. Word has length 34 [2020-02-10 20:07:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:02,112 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34113 transitions. [2020-02-10 20:07:02,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34113 transitions. [2020-02-10 20:07:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:02,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:02,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:02,123 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -927374598, now seen corresponding path program 161 times [2020-02-10 20:07:02,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:02,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440056381] [2020-02-10 20:07:02,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:02,685 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:07:02,838 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:07:02,989 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:03,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440056381] [2020-02-10 20:07:03,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:03,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:03,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229920153] [2020-02-10 20:07:03,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:03,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:03,001 INFO L87 Difference]: Start difference. First operand 6214 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:07:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:03,257 INFO L93 Difference]: Finished difference Result 11901 states and 58616 transitions. [2020-02-10 20:07:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:03,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:03,287 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:07:03,287 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:07:03,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:07:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 20:07:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:07:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34129 transitions. [2020-02-10 20:07:03,925 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34129 transitions. Word has length 34 [2020-02-10 20:07:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:03,925 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34129 transitions. [2020-02-10 20:07:03,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34129 transitions. [2020-02-10 20:07:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:03,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:03,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:03,937 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1675843802, now seen corresponding path program 162 times [2020-02-10 20:07:03,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:03,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063742773] [2020-02-10 20:07:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:04,488 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:07:04,631 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:07:04,787 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:04,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063742773] [2020-02-10 20:07:04,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:04,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:04,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277681327] [2020-02-10 20:07:04,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:04,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:04,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:04,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:04,797 INFO L87 Difference]: Start difference. First operand 6223 states and 34129 transitions. Second operand 13 states. [2020-02-10 20:07:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:05,129 INFO L93 Difference]: Finished difference Result 11897 states and 58600 transitions. [2020-02-10 20:07:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:05,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:05,158 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:07:05,158 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:07:05,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:07:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6206. [2020-02-10 20:07:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:07:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34090 transitions. [2020-02-10 20:07:05,799 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34090 transitions. Word has length 34 [2020-02-10 20:07:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:05,799 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34090 transitions. [2020-02-10 20:07:05,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34090 transitions. [2020-02-10 20:07:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:05,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:05,810 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1614437136, now seen corresponding path program 163 times [2020-02-10 20:07:05,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:05,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019354665] [2020-02-10 20:07:05,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:06,493 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:07:06,638 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:07:06,792 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:06,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019354665] [2020-02-10 20:07:06,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:06,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:06,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048515376] [2020-02-10 20:07:06,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:06,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:06,805 INFO L87 Difference]: Start difference. First operand 6206 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:07:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:07,105 INFO L93 Difference]: Finished difference Result 11886 states and 58594 transitions. [2020-02-10 20:07:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:07,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:07,135 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:07:07,135 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:07:07,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:07:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 20:07:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:07:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34130 transitions. [2020-02-10 20:07:07,779 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34130 transitions. Word has length 34 [2020-02-10 20:07:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:07,779 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34130 transitions. [2020-02-10 20:07:07,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34130 transitions. [2020-02-10 20:07:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:07,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:07,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:07,790 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1822899890, now seen corresponding path program 164 times [2020-02-10 20:07:07,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:07,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322606052] [2020-02-10 20:07:07,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:08,481 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:08,632 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:08,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322606052] [2020-02-10 20:07:08,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:08,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:08,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615597085] [2020-02-10 20:07:08,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:08,644 INFO L87 Difference]: Start difference. First operand 6220 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:07:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:08,950 INFO L93 Difference]: Finished difference Result 11889 states and 58593 transitions. [2020-02-10 20:07:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:08,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:08,980 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:07:08,980 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:07:08,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:07:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 20:07:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:07:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34110 transitions. [2020-02-10 20:07:09,616 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34110 transitions. Word has length 34 [2020-02-10 20:07:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:09,616 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34110 transitions. [2020-02-10 20:07:09,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34110 transitions. [2020-02-10 20:07:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:09,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:09,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:09,628 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1883183564, now seen corresponding path program 165 times [2020-02-10 20:07:09,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:09,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886548734] [2020-02-10 20:07:09,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:10,188 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:10,332 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:07:10,481 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:10,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886548734] [2020-02-10 20:07:10,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:10,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:10,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498029193] [2020-02-10 20:07:10,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:10,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:10,493 INFO L87 Difference]: Start difference. First operand 6213 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:07:10,803 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-02-10 20:07:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:10,845 INFO L93 Difference]: Finished difference Result 11884 states and 58583 transitions. [2020-02-10 20:07:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:10,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:10,900 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:07:10,900 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 20:07:10,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 20:07:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6220. [2020-02-10 20:07:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:07:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34123 transitions. [2020-02-10 20:07:11,649 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34123 transitions. Word has length 34 [2020-02-10 20:07:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:11,649 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34123 transitions. [2020-02-10 20:07:11,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34123 transitions. [2020-02-10 20:07:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:11,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:11,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:11,660 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -582803634, now seen corresponding path program 166 times [2020-02-10 20:07:11,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:11,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340788956] [2020-02-10 20:07:11,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:12,218 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:12,467 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:12,621 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:12,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340788956] [2020-02-10 20:07:12,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:12,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:12,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605826753] [2020-02-10 20:07:12,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:12,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:12,632 INFO L87 Difference]: Start difference. First operand 6220 states and 34123 transitions. Second operand 13 states. [2020-02-10 20:07:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:12,941 INFO L93 Difference]: Finished difference Result 11885 states and 58578 transitions. [2020-02-10 20:07:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:12,942 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:12,971 INFO L225 Difference]: With dead ends: 11885 [2020-02-10 20:07:12,971 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:07:12,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:07:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6213. [2020-02-10 20:07:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:07:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34103 transitions. [2020-02-10 20:07:13,619 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34103 transitions. Word has length 34 [2020-02-10 20:07:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:13,619 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34103 transitions. [2020-02-10 20:07:13,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34103 transitions. [2020-02-10 20:07:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:13,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:13,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:13,631 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -165827724, now seen corresponding path program 167 times [2020-02-10 20:07:13,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:13,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736206201] [2020-02-10 20:07:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:14,319 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:14,466 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:14,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736206201] [2020-02-10 20:07:14,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:14,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:14,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934421013] [2020-02-10 20:07:14,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:14,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:14,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:14,477 INFO L87 Difference]: Start difference. First operand 6213 states and 34103 transitions. Second operand 13 states. [2020-02-10 20:07:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:14,902 INFO L93 Difference]: Finished difference Result 11891 states and 58591 transitions. [2020-02-10 20:07:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:14,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:14,932 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:07:14,932 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:07:14,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:07:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 20:07:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:07:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34118 transitions. [2020-02-10 20:07:15,576 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34118 transitions. Word has length 34 [2020-02-10 20:07:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:15,577 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34118 transitions. [2020-02-10 20:07:15,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34118 transitions. [2020-02-10 20:07:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:15,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:15,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:15,588 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1544785584, now seen corresponding path program 168 times [2020-02-10 20:07:15,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:15,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027233630] [2020-02-10 20:07:15,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:16,130 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:07:16,275 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:16,429 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:16,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027233630] [2020-02-10 20:07:16,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:16,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102200863] [2020-02-10 20:07:16,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:16,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:16,441 INFO L87 Difference]: Start difference. First operand 6221 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:07:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:16,767 INFO L93 Difference]: Finished difference Result 11889 states and 58579 transitions. [2020-02-10 20:07:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:16,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:16,797 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:07:16,797 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:07:16,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:07:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6197. [2020-02-10 20:07:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:07:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34066 transitions. [2020-02-10 20:07:17,434 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34066 transitions. Word has length 34 [2020-02-10 20:07:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:17,434 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34066 transitions. [2020-02-10 20:07:17,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34066 transitions. [2020-02-10 20:07:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:17,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:17,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:17,445 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -834520410, now seen corresponding path program 169 times [2020-02-10 20:07:17,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:17,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581601061] [2020-02-10 20:07:17,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:18,022 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:18,179 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:07:18,427 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:18,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581601061] [2020-02-10 20:07:18,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:18,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:18,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409031946] [2020-02-10 20:07:18,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:18,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:18,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:18,440 INFO L87 Difference]: Start difference. First operand 6197 states and 34066 transitions. Second operand 13 states. [2020-02-10 20:07:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:18,722 INFO L93 Difference]: Finished difference Result 11931 states and 58720 transitions. [2020-02-10 20:07:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:18,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:18,751 INFO L225 Difference]: With dead ends: 11931 [2020-02-10 20:07:18,751 INFO L226 Difference]: Without dead ends: 11907 [2020-02-10 20:07:18,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11907 states. [2020-02-10 20:07:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11907 to 6231. [2020-02-10 20:07:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:07:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34172 transitions. [2020-02-10 20:07:19,392 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34172 transitions. Word has length 34 [2020-02-10 20:07:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:19,392 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34172 transitions. [2020-02-10 20:07:19,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34172 transitions. [2020-02-10 20:07:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:19,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:19,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:19,404 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1470987264, now seen corresponding path program 170 times [2020-02-10 20:07:19,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:19,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425257967] [2020-02-10 20:07:19,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:19,970 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:20,117 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:20,270 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:20,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425257967] [2020-02-10 20:07:20,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:20,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:20,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671762720] [2020-02-10 20:07:20,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:20,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:20,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:20,283 INFO L87 Difference]: Start difference. First operand 6231 states and 34172 transitions. Second operand 13 states. [2020-02-10 20:07:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:20,589 INFO L93 Difference]: Finished difference Result 11929 states and 58706 transitions. [2020-02-10 20:07:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:20,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:20,619 INFO L225 Difference]: With dead ends: 11929 [2020-02-10 20:07:20,619 INFO L226 Difference]: Without dead ends: 11895 [2020-02-10 20:07:20,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11895 states. [2020-02-10 20:07:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11895 to 6219. [2020-02-10 20:07:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:07:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34141 transitions. [2020-02-10 20:07:21,264 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34141 transitions. Word has length 34 [2020-02-10 20:07:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:21,264 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34141 transitions. [2020-02-10 20:07:21,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34141 transitions. [2020-02-10 20:07:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:21,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:21,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:21,276 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1188138650, now seen corresponding path program 171 times [2020-02-10 20:07:21,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:21,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904844603] [2020-02-10 20:07:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:22,017 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:07:22,171 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:22,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904844603] [2020-02-10 20:07:22,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:22,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:22,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259551738] [2020-02-10 20:07:22,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:22,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:22,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:22,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:22,185 INFO L87 Difference]: Start difference. First operand 6219 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:07:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:22,450 INFO L93 Difference]: Finished difference Result 11926 states and 58699 transitions. [2020-02-10 20:07:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:22,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:22,481 INFO L225 Difference]: With dead ends: 11926 [2020-02-10 20:07:22,481 INFO L226 Difference]: Without dead ends: 11902 [2020-02-10 20:07:22,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2020-02-10 20:07:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6228. [2020-02-10 20:07:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:07:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34157 transitions. [2020-02-10 20:07:23,120 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34157 transitions. Word has length 34 [2020-02-10 20:07:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:23,120 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34157 transitions. [2020-02-10 20:07:23,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34157 transitions. [2020-02-10 20:07:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:23,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:23,132 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2046050556, now seen corresponding path program 172 times [2020-02-10 20:07:23,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:23,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459653797] [2020-02-10 20:07:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:23,691 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:07:23,832 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:07:23,979 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:23,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459653797] [2020-02-10 20:07:23,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:23,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:23,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516345700] [2020-02-10 20:07:23,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:23,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:23,991 INFO L87 Difference]: Start difference. First operand 6228 states and 34157 transitions. Second operand 13 states. [2020-02-10 20:07:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:24,359 INFO L93 Difference]: Finished difference Result 11922 states and 58683 transitions. [2020-02-10 20:07:24,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:24,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:24,389 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 20:07:24,389 INFO L226 Difference]: Without dead ends: 11893 [2020-02-10 20:07:24,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2020-02-10 20:07:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 6219. [2020-02-10 20:07:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:07:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34132 transitions. [2020-02-10 20:07:25,032 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34132 transitions. Word has length 34 [2020-02-10 20:07:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:25,032 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34132 transitions. [2020-02-10 20:07:25,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34132 transitions. [2020-02-10 20:07:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:25,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:25,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:25,044 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -80241498, now seen corresponding path program 173 times [2020-02-10 20:07:25,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:25,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162231071] [2020-02-10 20:07:25,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:25,601 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:07:25,750 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:25,902 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:25,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162231071] [2020-02-10 20:07:25,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:25,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:25,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212150215] [2020-02-10 20:07:25,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:25,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:25,914 INFO L87 Difference]: Start difference. First operand 6219 states and 34132 transitions. Second operand 13 states. [2020-02-10 20:07:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:26,345 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 20:07:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:26,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:26,375 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:07:26,375 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 20:07:26,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 20:07:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6227. [2020-02-10 20:07:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:07:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34147 transitions. [2020-02-10 20:07:27,015 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34147 transitions. Word has length 34 [2020-02-10 20:07:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:27,015 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34147 transitions. [2020-02-10 20:07:27,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34147 transitions. [2020-02-10 20:07:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:27,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:27,027 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -504552734, now seen corresponding path program 174 times [2020-02-10 20:07:27,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:27,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058022695] [2020-02-10 20:07:27,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:27,730 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:27,884 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:27,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058022695] [2020-02-10 20:07:27,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:27,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789281566] [2020-02-10 20:07:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:27,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:27,898 INFO L87 Difference]: Start difference. First operand 6227 states and 34147 transitions. Second operand 13 states. [2020-02-10 20:07:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:28,271 INFO L93 Difference]: Finished difference Result 11919 states and 58670 transitions. [2020-02-10 20:07:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:28,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:28,302 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 20:07:28,302 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 20:07:28,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 20:07:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6209. [2020-02-10 20:07:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:07:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34105 transitions. [2020-02-10 20:07:28,952 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34105 transitions. Word has length 34 [2020-02-10 20:07:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:28,952 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34105 transitions. [2020-02-10 20:07:28,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34105 transitions. [2020-02-10 20:07:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:28,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:28,964 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 704268032, now seen corresponding path program 175 times [2020-02-10 20:07:28,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:28,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428075078] [2020-02-10 20:07:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:29,542 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:29,694 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-02-10 20:07:29,844 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-02-10 20:07:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:29,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428075078] [2020-02-10 20:07:29,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:29,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:29,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637880152] [2020-02-10 20:07:29,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:29,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:29,856 INFO L87 Difference]: Start difference. First operand 6209 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:07:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:30,231 INFO L93 Difference]: Finished difference Result 11936 states and 58723 transitions. [2020-02-10 20:07:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:30,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:30,261 INFO L225 Difference]: With dead ends: 11936 [2020-02-10 20:07:30,261 INFO L226 Difference]: Without dead ends: 11912 [2020-02-10 20:07:30,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11912 states. [2020-02-10 20:07:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11912 to 6233. [2020-02-10 20:07:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6233 states. [2020-02-10 20:07:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 34167 transitions. [2020-02-10 20:07:30,906 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 34167 transitions. Word has length 34 [2020-02-10 20:07:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:30,906 INFO L479 AbstractCegarLoop]: Abstraction has 6233 states and 34167 transitions. [2020-02-10 20:07:30,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 34167 transitions. [2020-02-10 20:07:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:30,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:30,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:30,917 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash 67801178, now seen corresponding path program 176 times [2020-02-10 20:07:30,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:30,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717936282] [2020-02-10 20:07:30,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:31,491 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:31,633 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:31,781 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:07:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:31,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717936282] [2020-02-10 20:07:31,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:31,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:31,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276752841] [2020-02-10 20:07:31,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:31,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:31,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:31,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:31,793 INFO L87 Difference]: Start difference. First operand 6233 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:07:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:32,137 INFO L93 Difference]: Finished difference Result 11934 states and 58709 transitions. [2020-02-10 20:07:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:32,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:32,167 INFO L225 Difference]: With dead ends: 11934 [2020-02-10 20:07:32,167 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:07:32,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:07:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6221. [2020-02-10 20:07:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:07:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34135 transitions. [2020-02-10 20:07:32,809 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34135 transitions. Word has length 34 [2020-02-10 20:07:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:32,809 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34135 transitions. [2020-02-10 20:07:32,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34135 transitions. [2020-02-10 20:07:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:32,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:32,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:32,820 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1632287462, now seen corresponding path program 177 times [2020-02-10 20:07:32,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:32,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045248842] [2020-02-10 20:07:32,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:33,404 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:33,554 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:07:33,706 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:33,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 20:07:33,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045248842] [2020-02-10 20:07:33,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:33,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:33,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318089473] [2020-02-10 20:07:33,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:33,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:33,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:33,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:33,719 INFO L87 Difference]: Start difference. First operand 6221 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:07:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:34,072 INFO L93 Difference]: Finished difference Result 11933 states and 58706 transitions. [2020-02-10 20:07:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:34,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:34,102 INFO L225 Difference]: With dead ends: 11933 [2020-02-10 20:07:34,102 INFO L226 Difference]: Without dead ends: 11909 [2020-02-10 20:07:34,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11909 states. [2020-02-10 20:07:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11909 to 6231. [2020-02-10 20:07:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:07:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34153 transitions. [2020-02-10 20:07:34,742 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34153 transitions. Word has length 34 [2020-02-10 20:07:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:34,743 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34153 transitions. [2020-02-10 20:07:34,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34153 transitions. [2020-02-10 20:07:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:34,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:34,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:34,754 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash -64957482, now seen corresponding path program 178 times [2020-02-10 20:07:34,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:34,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071484761] [2020-02-10 20:07:34,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:35,332 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:35,479 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:35,626 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:35,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071484761] [2020-02-10 20:07:35,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:35,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:35,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578325746] [2020-02-10 20:07:35,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:35,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:35,638 INFO L87 Difference]: Start difference. First operand 6231 states and 34153 transitions. Second operand 13 states. [2020-02-10 20:07:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:36,084 INFO L93 Difference]: Finished difference Result 11930 states and 58691 transitions. [2020-02-10 20:07:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:36,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:36,113 INFO L225 Difference]: With dead ends: 11930 [2020-02-10 20:07:36,114 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 20:07:36,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 20:07:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6221. [2020-02-10 20:07:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:07:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34125 transitions. [2020-02-10 20:07:36,757 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34125 transitions. Word has length 34 [2020-02-10 20:07:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:36,757 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34125 transitions. [2020-02-10 20:07:36,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34125 transitions. [2020-02-10 20:07:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:36,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:36,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:36,769 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1554782682, now seen corresponding path program 179 times [2020-02-10 20:07:36,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:36,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294752938] [2020-02-10 20:07:36,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:37,347 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:37,491 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:37,643 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:07:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:37,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294752938] [2020-02-10 20:07:37,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:37,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:37,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488824915] [2020-02-10 20:07:37,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:37,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:37,656 INFO L87 Difference]: Start difference. First operand 6221 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:07:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:38,003 INFO L93 Difference]: Finished difference Result 11928 states and 58688 transitions. [2020-02-10 20:07:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:38,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:38,033 INFO L225 Difference]: With dead ends: 11928 [2020-02-10 20:07:38,033 INFO L226 Difference]: Without dead ends: 11906 [2020-02-10 20:07:38,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2020-02-10 20:07:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 6230. [2020-02-10 20:07:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2020-02-10 20:07:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 34142 transitions. [2020-02-10 20:07:38,672 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 34142 transitions. Word has length 34 [2020-02-10 20:07:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:38,672 INFO L479 AbstractCegarLoop]: Abstraction has 6230 states and 34142 transitions. [2020-02-10 20:07:38,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 34142 transitions. [2020-02-10 20:07:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:38,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:38,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:38,683 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:38,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1679406524, now seen corresponding path program 180 times [2020-02-10 20:07:38,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:38,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835551116] [2020-02-10 20:07:38,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:39,257 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:39,403 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:39,555 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:07:39,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 20:07:39,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835551116] [2020-02-10 20:07:39,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:39,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:39,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753582090] [2020-02-10 20:07:39,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:39,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:39,568 INFO L87 Difference]: Start difference. First operand 6230 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:07:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:39,857 INFO L93 Difference]: Finished difference Result 11927 states and 58677 transitions. [2020-02-10 20:07:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:39,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:39,887 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 20:07:39,887 INFO L226 Difference]: Without dead ends: 11885 [2020-02-10 20:07:39,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2020-02-10 20:07:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 6209. [2020-02-10 20:07:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:07:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34094 transitions. [2020-02-10 20:07:40,524 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34094 transitions. Word has length 34 [2020-02-10 20:07:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:40,524 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34094 transitions. [2020-02-10 20:07:40,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34094 transitions. [2020-02-10 20:07:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:40,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:40,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:40,535 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1810659904, now seen corresponding path program 181 times [2020-02-10 20:07:40,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:40,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109444427] [2020-02-10 20:07:40,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:41,113 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:07:41,262 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:07:41,410 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:41,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109444427] [2020-02-10 20:07:41,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:41,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:41,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942735879] [2020-02-10 20:07:41,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:41,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:41,424 INFO L87 Difference]: Start difference. First operand 6209 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:07:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:41,744 INFO L93 Difference]: Finished difference Result 11922 states and 58680 transitions. [2020-02-10 20:07:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:41,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:41,776 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 20:07:41,776 INFO L226 Difference]: Without dead ends: 11898 [2020-02-10 20:07:41,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11898 states. [2020-02-10 20:07:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11898 to 6227. [2020-02-10 20:07:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:07:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34144 transitions. [2020-02-10 20:07:42,416 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34144 transitions. Word has length 34 [2020-02-10 20:07:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:42,416 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34144 transitions. [2020-02-10 20:07:42,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34144 transitions. [2020-02-10 20:07:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:42,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:42,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:42,427 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 749881814, now seen corresponding path program 182 times [2020-02-10 20:07:42,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:42,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186517279] [2020-02-10 20:07:42,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:43,015 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:07:43,159 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:07:43,313 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:43,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186517279] [2020-02-10 20:07:43,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:43,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:43,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948869807] [2020-02-10 20:07:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:43,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:43,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:43,325 INFO L87 Difference]: Start difference. First operand 6227 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:07:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:43,631 INFO L93 Difference]: Finished difference Result 11918 states and 58664 transitions. [2020-02-10 20:07:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:43,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:43,661 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:07:43,661 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 20:07:43,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 20:07:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6218. [2020-02-10 20:07:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:07:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34119 transitions. [2020-02-10 20:07:44,305 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34119 transitions. Word has length 34 [2020-02-10 20:07:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:44,305 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34119 transitions. [2020-02-10 20:07:44,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34119 transitions. [2020-02-10 20:07:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:44,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:44,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:44,317 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -739943386, now seen corresponding path program 183 times [2020-02-10 20:07:44,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:44,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614117125] [2020-02-10 20:07:44,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:44,888 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:45,042 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:07:45,191 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:45,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614117125] [2020-02-10 20:07:45,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:45,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:45,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179234406] [2020-02-10 20:07:45,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:45,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:45,204 INFO L87 Difference]: Start difference. First operand 6218 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:07:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:45,470 INFO L93 Difference]: Finished difference Result 11924 states and 58676 transitions. [2020-02-10 20:07:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:45,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:45,499 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 20:07:45,499 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:07:45,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:07:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6228. [2020-02-10 20:07:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:07:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34137 transitions. [2020-02-10 20:07:46,138 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34137 transitions. Word has length 34 [2020-02-10 20:07:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:46,138 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34137 transitions. [2020-02-10 20:07:46,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34137 transitions. [2020-02-10 20:07:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:46,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:46,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:46,150 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1857778966, now seen corresponding path program 184 times [2020-02-10 20:07:46,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:46,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384960157] [2020-02-10 20:07:46,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:46,727 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:46,871 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:47,022 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:47,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384960157] [2020-02-10 20:07:47,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:47,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:47,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589167794] [2020-02-10 20:07:47,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:47,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:47,034 INFO L87 Difference]: Start difference. First operand 6228 states and 34137 transitions. Second operand 13 states. [2020-02-10 20:07:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:47,410 INFO L93 Difference]: Finished difference Result 11921 states and 58661 transitions. [2020-02-10 20:07:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:47,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:47,541 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:07:47,541 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:07:47,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:07:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6218. [2020-02-10 20:07:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:07:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 20:07:48,170 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 20:07:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:48,171 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 20:07:48,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 20:07:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:48,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:48,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:48,181 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -325103898, now seen corresponding path program 185 times [2020-02-10 20:07:48,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:48,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518722617] [2020-02-10 20:07:48,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:48,734 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:48,877 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:07:49,026 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:49,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518722617] [2020-02-10 20:07:49,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:49,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:49,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098226720] [2020-02-10 20:07:49,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:49,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:49,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:49,038 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:07:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:49,369 INFO L93 Difference]: Finished difference Result 11914 states and 58648 transitions. [2020-02-10 20:07:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:49,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:49,399 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:07:49,400 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 20:07:49,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 20:07:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6226. [2020-02-10 20:07:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:07:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 20:07:50,036 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 20:07:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:50,036 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 20:07:50,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 20:07:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:50,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:50,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:50,048 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash -961570752, now seen corresponding path program 186 times [2020-02-10 20:07:50,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:50,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72925517] [2020-02-10 20:07:50,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:50,620 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:50,766 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:50,916 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:07:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:50,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72925517] [2020-02-10 20:07:50,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:50,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:50,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780835483] [2020-02-10 20:07:50,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:50,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:50,929 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:07:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:51,306 INFO L93 Difference]: Finished difference Result 11915 states and 58642 transitions. [2020-02-10 20:07:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:51,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:51,336 INFO L225 Difference]: With dead ends: 11915 [2020-02-10 20:07:51,336 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:07:51,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:07:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6209. [2020-02-10 20:07:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:07:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34085 transitions. [2020-02-10 20:07:51,982 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34085 transitions. Word has length 34 [2020-02-10 20:07:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:51,983 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34085 transitions. [2020-02-10 20:07:51,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34085 transitions. [2020-02-10 20:07:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:51,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:51,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:51,994 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1159266394, now seen corresponding path program 187 times [2020-02-10 20:07:51,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:51,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97923841] [2020-02-10 20:07:51,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:52,703 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:52,852 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:52,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97923841] [2020-02-10 20:07:52,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:52,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:52,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350178980] [2020-02-10 20:07:52,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:52,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:52,865 INFO L87 Difference]: Start difference. First operand 6209 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:07:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:53,173 INFO L93 Difference]: Finished difference Result 11912 states and 58653 transitions. [2020-02-10 20:07:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:53,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:53,202 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 20:07:53,202 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:07:53,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:07:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6225. [2020-02-10 20:07:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:07:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34131 transitions. [2020-02-10 20:07:53,918 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34131 transitions. Word has length 34 [2020-02-10 20:07:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:53,918 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34131 transitions. [2020-02-10 20:07:53,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34131 transitions. [2020-02-10 20:07:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:53,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:53,930 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 734955158, now seen corresponding path program 188 times [2020-02-10 20:07:53,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:53,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680659124] [2020-02-10 20:07:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:54,635 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:54,790 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:07:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:54,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680659124] [2020-02-10 20:07:54,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:54,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:54,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604010899] [2020-02-10 20:07:54,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:54,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:54,803 INFO L87 Difference]: Start difference. First operand 6225 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:07:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:55,153 INFO L93 Difference]: Finished difference Result 11910 states and 58641 transitions. [2020-02-10 20:07:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:55,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:55,183 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:07:55,183 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 20:07:55,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 20:07:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6217. [2020-02-10 20:07:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:07:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34108 transitions. [2020-02-10 20:07:55,825 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34108 transitions. Word has length 34 [2020-02-10 20:07:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:55,825 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34108 transitions. [2020-02-10 20:07:55,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34108 transitions. [2020-02-10 20:07:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:55,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:55,836 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1391336896, now seen corresponding path program 189 times [2020-02-10 20:07:55,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:55,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978193626] [2020-02-10 20:07:55,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:56,404 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:56,551 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:07:56,700 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:07:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:56,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978193626] [2020-02-10 20:07:56,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:56,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:56,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976415513] [2020-02-10 20:07:56,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:56,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:56,712 INFO L87 Difference]: Start difference. First operand 6217 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:07:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:57,039 INFO L93 Difference]: Finished difference Result 11914 states and 58650 transitions. [2020-02-10 20:07:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:57,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:57,068 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:07:57,068 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 20:07:57,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 20:07:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6226. [2020-02-10 20:07:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:07:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 20:07:57,709 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 20:07:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:57,709 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 20:07:57,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 20:07:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:57,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:57,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:57,721 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1842852310, now seen corresponding path program 190 times [2020-02-10 20:07:57,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:57,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345728105] [2020-02-10 20:07:57,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:58,290 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:58,440 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:07:58,595 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:07:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:58,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345728105] [2020-02-10 20:07:58,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:58,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:07:58,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140390240] [2020-02-10 20:07:58,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:07:58,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:58,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:07:58,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:58,608 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:07:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:58,937 INFO L93 Difference]: Finished difference Result 11913 states and 58639 transitions. [2020-02-10 20:07:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:07:58,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:07:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:58,966 INFO L225 Difference]: With dead ends: 11913 [2020-02-10 20:07:58,966 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 20:07:58,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:07:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 20:07:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6217. [2020-02-10 20:07:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:07:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34100 transitions. [2020-02-10 20:07:59,686 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34100 transitions. Word has length 34 [2020-02-10 20:07:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:59,686 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34100 transitions. [2020-02-10 20:07:59,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:07:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34100 transitions. [2020-02-10 20:07:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:07:59,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:59,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:59,698 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2084394560, now seen corresponding path program 191 times [2020-02-10 20:07:59,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:59,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738928950] [2020-02-10 20:07:59,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:00,268 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:00,414 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:08:00,568 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:08:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:00,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738928950] [2020-02-10 20:08:00,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:00,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:00,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75960322] [2020-02-10 20:08:00,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:00,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:00,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:00,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:00,581 INFO L87 Difference]: Start difference. First operand 6217 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:08:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:00,916 INFO L93 Difference]: Finished difference Result 11909 states and 58631 transitions. [2020-02-10 20:08:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:00,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:00,946 INFO L225 Difference]: With dead ends: 11909 [2020-02-10 20:08:00,946 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 20:08:00,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 20:08:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6225. [2020-02-10 20:08:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:08:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34115 transitions. [2020-02-10 20:08:01,584 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34115 transitions. Word has length 34 [2020-02-10 20:08:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:01,584 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34115 transitions. [2020-02-10 20:08:01,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34115 transitions. [2020-02-10 20:08:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:01,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:01,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:01,596 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1574105882, now seen corresponding path program 192 times [2020-02-10 20:08:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:01,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789083294] [2020-02-10 20:08:01,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:02,162 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:02,309 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:08:02,458 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:08:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:02,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789083294] [2020-02-10 20:08:02,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:02,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:02,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254395049] [2020-02-10 20:08:02,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:02,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:02,471 INFO L87 Difference]: Start difference. First operand 6225 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:08:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:02,781 INFO L93 Difference]: Finished difference Result 11910 states and 58625 transitions. [2020-02-10 20:08:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:02,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:02,812 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:08:02,812 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:08:02,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:08:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6197. [2020-02-10 20:08:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:08:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34055 transitions. [2020-02-10 20:08:03,454 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34055 transitions. Word has length 34 [2020-02-10 20:08:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:03,454 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34055 transitions. [2020-02-10 20:08:03,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34055 transitions. [2020-02-10 20:08:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:03,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:03,465 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1168931478, now seen corresponding path program 193 times [2020-02-10 20:08:03,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:03,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104223426] [2020-02-10 20:08:03,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:04,032 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:04,176 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:04,328 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:04,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104223426] [2020-02-10 20:08:04,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:04,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076377992] [2020-02-10 20:08:04,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:04,341 INFO L87 Difference]: Start difference. First operand 6197 states and 34055 transitions. Second operand 13 states. [2020-02-10 20:08:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:04,650 INFO L93 Difference]: Finished difference Result 11888 states and 58602 transitions. [2020-02-10 20:08:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:04,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:04,680 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 20:08:04,681 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:08:04,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:08:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 20:08:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:08:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34138 transitions. [2020-02-10 20:08:05,410 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34138 transitions. Word has length 34 [2020-02-10 20:08:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:05,410 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34138 transitions. [2020-02-10 20:08:05,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34138 transitions. [2020-02-10 20:08:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:05,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:05,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:05,421 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 183995194, now seen corresponding path program 194 times [2020-02-10 20:08:05,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:05,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896816856] [2020-02-10 20:08:05,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:05,979 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:06,133 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:08:06,281 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:06,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896816856] [2020-02-10 20:08:06,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:06,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:06,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802714732] [2020-02-10 20:08:06,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:06,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:06,292 INFO L87 Difference]: Start difference. First operand 6221 states and 34138 transitions. Second operand 13 states. [2020-02-10 20:08:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:06,653 INFO L93 Difference]: Finished difference Result 11893 states and 58604 transitions. [2020-02-10 20:08:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:06,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:06,682 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:08:06,682 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:08:06,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:08:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6213. [2020-02-10 20:08:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:08:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34115 transitions. [2020-02-10 20:08:07,326 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34115 transitions. Word has length 34 [2020-02-10 20:08:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:07,326 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34115 transitions. [2020-02-10 20:08:07,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34115 transitions. [2020-02-10 20:08:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:07,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08: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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:07,337 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:07,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1650418240, now seen corresponding path program 195 times [2020-02-10 20:08:07,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:07,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241351234] [2020-02-10 20:08:07,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:07,892 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:08:08,031 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:08,181 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:08,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 20:08:08,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241351234] [2020-02-10 20:08:08,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:08,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:08,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063864336] [2020-02-10 20:08:08,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:08,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:08,193 INFO L87 Difference]: Start difference. First operand 6213 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:08:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:08,590 INFO L93 Difference]: Finished difference Result 11883 states and 58585 transitions. [2020-02-10 20:08:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:08,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:08,621 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:08:08,621 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 20:08:08,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 20:08:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6220. [2020-02-10 20:08:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:08:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34128 transitions. [2020-02-10 20:08:09,257 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34128 transitions. Word has length 34 [2020-02-10 20:08:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:09,257 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34128 transitions. [2020-02-10 20:08:09,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34128 transitions. [2020-02-10 20:08:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:09,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:09,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:09,268 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -350038310, now seen corresponding path program 196 times [2020-02-10 20:08:09,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:09,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584262869] [2020-02-10 20:08:09,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:09,840 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:08:09,985 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:10,136 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:10,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584262869] [2020-02-10 20:08:10,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:10,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:10,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429102669] [2020-02-10 20:08:10,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:10,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:10,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:10,149 INFO L87 Difference]: Start difference. First operand 6220 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:08:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:10,560 INFO L93 Difference]: Finished difference Result 11884 states and 58580 transitions. [2020-02-10 20:08:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:10,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:10,594 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:08:10,594 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:08:10,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:08:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6213. [2020-02-10 20:08:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:08:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34108 transitions. [2020-02-10 20:08:11,338 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34108 transitions. Word has length 34 [2020-02-10 20:08:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:11,338 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34108 transitions. [2020-02-10 20:08:11,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34108 transitions. [2020-02-10 20:08:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:11,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:11,349 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1841067360, now seen corresponding path program 197 times [2020-02-10 20:08:11,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:11,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168046927] [2020-02-10 20:08:11,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:11,914 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:12,067 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:08:12,215 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:12,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168046927] [2020-02-10 20:08:12,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:12,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:12,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888806113] [2020-02-10 20:08:12,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:12,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:12,226 INFO L87 Difference]: Start difference. First operand 6213 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:08:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:12,511 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 20:08:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:12,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:12,541 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:08:12,541 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 20:08:12,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 20:08:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6222. [2020-02-10 20:08:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:08:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34124 transitions. [2020-02-10 20:08:13,179 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34124 transitions. Word has length 34 [2020-02-10 20:08:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:13,179 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34124 transitions. [2020-02-10 20:08:13,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34124 transitions. [2020-02-10 20:08:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:13,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:13,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:13,191 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:13,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash 149318464, now seen corresponding path program 198 times [2020-02-10 20:08:13,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:13,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833418729] [2020-02-10 20:08:13,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:13,758 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:13,901 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:14,053 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:14,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833418729] [2020-02-10 20:08:14,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:14,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:14,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902245543] [2020-02-10 20:08:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:14,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:14,064 INFO L87 Difference]: Start difference. First operand 6222 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:08:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:14,377 INFO L93 Difference]: Finished difference Result 11891 states and 58585 transitions. [2020-02-10 20:08:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:14,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:14,407 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:08:14,408 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:08:14,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:08:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6205. [2020-02-10 20:08:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:08:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34085 transitions. [2020-02-10 20:08:15,049 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34085 transitions. Word has length 34 [2020-02-10 20:08:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:15,049 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34085 transitions. [2020-02-10 20:08:15,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34085 transitions. [2020-02-10 20:08:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:15,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:15,060 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash -590359184, now seen corresponding path program 199 times [2020-02-10 20:08:15,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:15,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573123843] [2020-02-10 20:08:15,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:15,621 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:15,767 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:08:15,914 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:15,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573123843] [2020-02-10 20:08:15,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:15,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:15,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982616467] [2020-02-10 20:08:15,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:15,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:15,926 INFO L87 Difference]: Start difference. First operand 6205 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:08:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:16,416 INFO L93 Difference]: Finished difference Result 11890 states and 58599 transitions. [2020-02-10 20:08:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:16,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:16,447 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:08:16,447 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 20:08:16,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 20:08:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6221. [2020-02-10 20:08:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:08:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34130 transitions. [2020-02-10 20:08:17,233 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34130 transitions. Word has length 34 [2020-02-10 20:08:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:17,233 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34130 transitions. [2020-02-10 20:08:17,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34130 transitions. [2020-02-10 20:08:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:17,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:17,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:17,246 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1575295468, now seen corresponding path program 200 times [2020-02-10 20:08:17,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:17,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955082066] [2020-02-10 20:08:17,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:17,803 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:17,951 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:08:18,099 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:18,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955082066] [2020-02-10 20:08:18,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:18,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:18,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123833873] [2020-02-10 20:08:18,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:18,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:18,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:18,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:18,110 INFO L87 Difference]: Start difference. First operand 6221 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:08:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:18,561 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 20:08:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:18,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:18,590 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:08:18,590 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:08:18,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:08:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6213. [2020-02-10 20:08:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:08:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34107 transitions. [2020-02-10 20:08:19,232 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34107 transitions. Word has length 34 [2020-02-10 20:08:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:19,232 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34107 transitions. [2020-02-10 20:08:19,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34107 transitions. [2020-02-10 20:08:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:19,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:19,243 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1665344896, now seen corresponding path program 201 times [2020-02-10 20:08:19,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:19,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900561416] [2020-02-10 20:08:19,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:19,924 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:08:20,071 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900561416] [2020-02-10 20:08:20,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:20,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:20,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173496659] [2020-02-10 20:08:20,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:20,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:20,084 INFO L87 Difference]: Start difference. First operand 6213 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:08:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:20,365 INFO L93 Difference]: Finished difference Result 11886 states and 58584 transitions. [2020-02-10 20:08:20,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:20,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:20,394 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:08:20,394 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:08:20,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:08:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 20:08:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:08:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34120 transitions. [2020-02-10 20:08:21,032 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34120 transitions. Word has length 34 [2020-02-10 20:08:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:21,032 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34120 transitions. [2020-02-10 20:08:21,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34120 transitions. [2020-02-10 20:08:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:21,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:21,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:21,043 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash -249184588, now seen corresponding path program 202 times [2020-02-10 20:08:21,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:21,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316127493] [2020-02-10 20:08:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:21,729 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:08:21,880 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:21,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316127493] [2020-02-10 20:08:21,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:21,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:21,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060147742] [2020-02-10 20:08:21,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:21,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:21,893 INFO L87 Difference]: Start difference. First operand 6220 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:08:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:22,187 INFO L93 Difference]: Finished difference Result 11888 states and 58581 transitions. [2020-02-10 20:08:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:22,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:22,216 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 20:08:22,216 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:08:22,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:08:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 20:08:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:08:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 20:08:22,856 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 20:08:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:22,857 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 20:08:22,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 20:08:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:22,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:22,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:22,868 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -623998880, now seen corresponding path program 203 times [2020-02-10 20:08:22,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:22,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641617644] [2020-02-10 20:08:22,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:23,394 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-02-10 20:08:23,518 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:23,668 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:08:23,819 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:23,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641617644] [2020-02-10 20:08:23,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:23,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:23,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453868427] [2020-02-10 20:08:23,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:23,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:23,830 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:08:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:24,083 INFO L93 Difference]: Finished difference Result 11899 states and 58603 transitions. [2020-02-10 20:08:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:24,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:24,112 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 20:08:24,112 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:08:24,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:08:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6223. [2020-02-10 20:08:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:08:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34118 transitions. [2020-02-10 20:08:24,746 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34118 transitions. Word has length 34 [2020-02-10 20:08:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:24,746 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34118 transitions. [2020-02-10 20:08:24,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34118 transitions. [2020-02-10 20:08:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:24,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:24,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:24,757 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1877214864, now seen corresponding path program 204 times [2020-02-10 20:08:24,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:24,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460913673] [2020-02-10 20:08:24,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:25,310 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:25,451 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:08:25,600 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:25,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460913673] [2020-02-10 20:08:25,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:25,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:25,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126184214] [2020-02-10 20:08:25,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:25,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:25,611 INFO L87 Difference]: Start difference. First operand 6223 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:08:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:25,966 INFO L93 Difference]: Finished difference Result 11896 states and 58588 transitions. [2020-02-10 20:08:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:25,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:25,996 INFO L225 Difference]: With dead ends: 11896 [2020-02-10 20:08:25,997 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:08:25,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:08:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6205. [2020-02-10 20:08:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:08:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34077 transitions. [2020-02-10 20:08:26,634 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34077 transitions. Word has length 34 [2020-02-10 20:08:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:26,634 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34077 transitions. [2020-02-10 20:08:26,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34077 transitions. [2020-02-10 20:08:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:26,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:26,645 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -615236944, now seen corresponding path program 205 times [2020-02-10 20:08:26,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:26,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140825883] [2020-02-10 20:08:26,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:27,207 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:08:27,355 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:27,506 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140825883] [2020-02-10 20:08:27,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:27,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:27,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542163939] [2020-02-10 20:08:27,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:27,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:27,518 INFO L87 Difference]: Start difference. First operand 6205 states and 34077 transitions. Second operand 13 states. [2020-02-10 20:08:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:27,928 INFO L93 Difference]: Finished difference Result 11877 states and 58565 transitions. [2020-02-10 20:08:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:27,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:27,958 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 20:08:27,958 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:08:27,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:08:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6219. [2020-02-10 20:08:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:08:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34117 transitions. [2020-02-10 20:08:28,596 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34117 transitions. Word has length 34 [2020-02-10 20:08:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:28,597 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34117 transitions. [2020-02-10 20:08:28,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34117 transitions. [2020-02-10 20:08:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:28,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:28,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:28,608 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash 685142986, now seen corresponding path program 206 times [2020-02-10 20:08:28,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:28,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157492971] [2020-02-10 20:08:28,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:29,163 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:08:29,304 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:29,451 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:29,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 20:08:29,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157492971] [2020-02-10 20:08:29,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:29,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:29,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817475308] [2020-02-10 20:08:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:29,463 INFO L87 Difference]: Start difference. First operand 6219 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:08:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:29,824 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 20:08:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:29,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:29,854 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 20:08:29,854 INFO L226 Difference]: Without dead ends: 11851 [2020-02-10 20:08:29,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2020-02-10 20:08:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 6212. [2020-02-10 20:08:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:08:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:08:30,494 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:08:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:30,495 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:08:30,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:08:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:30,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:30,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:30,506 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1129127062, now seen corresponding path program 207 times [2020-02-10 20:08:30,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:30,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341294611] [2020-02-10 20:08:30,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:31,191 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:08:31,341 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:31,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341294611] [2020-02-10 20:08:31,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:31,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:31,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331733978] [2020-02-10 20:08:31,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:31,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:31,353 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:08:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:31,652 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 20:08:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:31,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:31,682 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 20:08:31,682 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 20:08:31,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 20:08:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6219. [2020-02-10 20:08:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:08:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34110 transitions. [2020-02-10 20:08:32,326 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34110 transitions. Word has length 34 [2020-02-10 20:08:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:32,326 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34110 transitions. [2020-02-10 20:08:32,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34110 transitions. [2020-02-10 20:08:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:32,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:32,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:32,339 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1749679926, now seen corresponding path program 208 times [2020-02-10 20:08:32,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:32,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480305725] [2020-02-10 20:08:32,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:33,046 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:08:33,193 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:08:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:33,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480305725] [2020-02-10 20:08:33,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:33,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:33,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715173596] [2020-02-10 20:08:33,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:33,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:33,205 INFO L87 Difference]: Start difference. First operand 6219 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:08:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:33,578 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 20:08:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:33,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:33,607 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:08:33,608 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:08:33,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:08:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 20:08:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:08:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34090 transitions. [2020-02-10 20:08:34,247 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34090 transitions. Word has length 34 [2020-02-10 20:08:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:34,247 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34090 transitions. [2020-02-10 20:08:34,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34090 transitions. [2020-02-10 20:08:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:34,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:34,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:34,259 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1636439574, now seen corresponding path program 209 times [2020-02-10 20:08:34,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:34,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786461348] [2020-02-10 20:08:34,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:34,811 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:34,957 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:35,109 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:35,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786461348] [2020-02-10 20:08:35,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:35,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:35,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477455756] [2020-02-10 20:08:35,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:35,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:35,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:35,121 INFO L87 Difference]: Start difference. First operand 6212 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:08:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:35,516 INFO L93 Difference]: Finished difference Result 11881 states and 58560 transitions. [2020-02-10 20:08:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:35,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:35,640 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 20:08:35,640 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:08:35,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:08:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6220. [2020-02-10 20:08:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:08:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34105 transitions. [2020-02-10 20:08:36,273 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34105 transitions. Word has length 34 [2020-02-10 20:08:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:36,273 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34105 transitions. [2020-02-10 20:08:36,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34105 transitions. [2020-02-10 20:08:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:36,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:36,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:36,284 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -92607760, now seen corresponding path program 210 times [2020-02-10 20:08:36,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:36,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899945075] [2020-02-10 20:08:36,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:36,828 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:36,973 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:08:37,128 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:37,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899945075] [2020-02-10 20:08:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:37,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619704813] [2020-02-10 20:08:37,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:37,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:37,140 INFO L87 Difference]: Start difference. First operand 6220 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:08:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:37,595 INFO L93 Difference]: Finished difference Result 11882 states and 58554 transitions. [2020-02-10 20:08:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:37,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:37,625 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 20:08:37,626 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:08:37,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:08:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6205. [2020-02-10 20:08:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:08:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34070 transitions. [2020-02-10 20:08:38,264 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34070 transitions. Word has length 34 [2020-02-10 20:08:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:38,265 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34070 transitions. [2020-02-10 20:08:38,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34070 transitions. [2020-02-10 20:08:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:38,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:38,276 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1266490516, now seen corresponding path program 211 times [2020-02-10 20:08:38,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:38,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544706163] [2020-02-10 20:08:38,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:38,846 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:38,999 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:08:39,149 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:39,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544706163] [2020-02-10 20:08:39,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:39,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:39,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639617124] [2020-02-10 20:08:39,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:39,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:39,161 INFO L87 Difference]: Start difference. First operand 6205 states and 34070 transitions. Second operand 13 states. [2020-02-10 20:08:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:39,508 INFO L93 Difference]: Finished difference Result 11901 states and 58610 transitions. [2020-02-10 20:08:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:39,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:39,537 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:08:39,537 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:08:39,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:08:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 20:08:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:08:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34120 transitions. [2020-02-10 20:08:40,174 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34120 transitions. Word has length 34 [2020-02-10 20:08:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:40,174 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34120 transitions. [2020-02-10 20:08:40,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34120 transitions. [2020-02-10 20:08:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:40,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:40,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:40,185 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -425258380, now seen corresponding path program 212 times [2020-02-10 20:08:40,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:40,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327850071] [2020-02-10 20:08:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:40,782 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:08:40,927 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:41,078 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:41,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327850071] [2020-02-10 20:08:41,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:41,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:41,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336543787] [2020-02-10 20:08:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:41,090 INFO L87 Difference]: Start difference. First operand 6223 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:08:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:41,385 INFO L93 Difference]: Finished difference Result 11897 states and 58594 transitions. [2020-02-10 20:08:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:41,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:41,416 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:08:41,416 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:08:41,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:08:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 20:08:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:08:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 20:08:42,142 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 20:08:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:42,142 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 20:08:42,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 20:08:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:42,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:42,154 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -794369286, now seen corresponding path program 213 times [2020-02-10 20:08:42,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:42,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199851945] [2020-02-10 20:08:42,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:42,849 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:08:42,993 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:43,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 20:08:43,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199851945] [2020-02-10 20:08:43,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:43,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:43,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000608826] [2020-02-10 20:08:43,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:43,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:43,006 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:08:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:43,285 INFO L93 Difference]: Finished difference Result 11903 states and 58606 transitions. [2020-02-10 20:08:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:43,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:43,315 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 20:08:43,315 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:08:43,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:08:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6224. [2020-02-10 20:08:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:08:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34113 transitions. [2020-02-10 20:08:43,955 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34113 transitions. Word has length 34 [2020-02-10 20:08:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:43,956 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34113 transitions. [2020-02-10 20:08:43,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34113 transitions. [2020-02-10 20:08:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:43,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:43,967 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2047585270, now seen corresponding path program 214 times [2020-02-10 20:08:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135066491] [2020-02-10 20:08:43,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:44,531 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:44,680 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:08:44,831 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:44,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135066491] [2020-02-10 20:08:44,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:44,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:44,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637399716] [2020-02-10 20:08:44,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:44,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:44,842 INFO L87 Difference]: Start difference. First operand 6224 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:08:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:45,193 INFO L93 Difference]: Finished difference Result 11900 states and 58591 transitions. [2020-02-10 20:08:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:45,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:45,222 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:08:45,223 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:08:45,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:08:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6214. [2020-02-10 20:08:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:08:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34086 transitions. [2020-02-10 20:08:45,862 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34086 transitions. Word has length 34 [2020-02-10 20:08:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:45,862 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34086 transitions. [2020-02-10 20:08:45,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34086 transitions. [2020-02-10 20:08:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:45,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:45,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:45,873 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -926406668, now seen corresponding path program 215 times [2020-02-10 20:08:45,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:45,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117099091] [2020-02-10 20:08:45,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:46,430 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:46,574 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:46,726 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:46,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117099091] [2020-02-10 20:08:46,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:46,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:46,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442416367] [2020-02-10 20:08:46,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:46,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:46,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:46,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:46,738 INFO L87 Difference]: Start difference. First operand 6214 states and 34086 transitions. Second operand 13 states. [2020-02-10 20:08:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:47,081 INFO L93 Difference]: Finished difference Result 11893 states and 58578 transitions. [2020-02-10 20:08:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:47,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:47,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:47,111 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:08:47,111 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:08:47,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:08:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6222. [2020-02-10 20:08:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:08:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34101 transitions. [2020-02-10 20:08:47,895 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34101 transitions. Word has length 34 [2020-02-10 20:08:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:47,895 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34101 transitions. [2020-02-10 20:08:47,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34101 transitions. [2020-02-10 20:08:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:47,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:47,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:47,907 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1650216922, now seen corresponding path program 216 times [2020-02-10 20:08:47,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:47,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288717051] [2020-02-10 20:08:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:48,467 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:48,613 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:08:48,762 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:48,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288717051] [2020-02-10 20:08:48,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:48,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:48,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593727409] [2020-02-10 20:08:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:48,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:48,774 INFO L87 Difference]: Start difference. First operand 6222 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:08:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:49,122 INFO L93 Difference]: Finished difference Result 11894 states and 58572 transitions. [2020-02-10 20:08:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:49,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:49,152 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:08:49,152 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:08:49,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:08:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6197. [2020-02-10 20:08:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:08:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34047 transitions. [2020-02-10 20:08:49,791 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34047 transitions. Word has length 34 [2020-02-10 20:08:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:49,791 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34047 transitions. [2020-02-10 20:08:49,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34047 transitions. [2020-02-10 20:08:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:49,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:49,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:49,802 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1844398148, now seen corresponding path program 217 times [2020-02-10 20:08:49,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:49,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122006127] [2020-02-10 20:08:49,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:50,483 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:50,634 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:50,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122006127] [2020-02-10 20:08:50,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:50,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:50,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2428684] [2020-02-10 20:08:50,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:50,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:50,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:50,646 INFO L87 Difference]: Start difference. First operand 6197 states and 34047 transitions. Second operand 13 states. [2020-02-10 20:08:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:51,016 INFO L93 Difference]: Finished difference Result 11871 states and 58557 transitions. [2020-02-10 20:08:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:51,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:51,047 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:08:51,047 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:08:51,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:08:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6218. [2020-02-10 20:08:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:08:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34121 transitions. [2020-02-10 20:08:51,689 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34121 transitions. Word has length 34 [2020-02-10 20:08:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:51,690 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34121 transitions. [2020-02-10 20:08:51,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34121 transitions. [2020-02-10 20:08:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:51,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:51,701 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2052860902, now seen corresponding path program 218 times [2020-02-10 20:08:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:51,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972086590] [2020-02-10 20:08:51,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:52,392 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:08:52,542 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972086590] [2020-02-10 20:08:52,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:52,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:52,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949916285] [2020-02-10 20:08:52,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:52,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:52,554 INFO L87 Difference]: Start difference. First operand 6218 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:08:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:52,891 INFO L93 Difference]: Finished difference Result 11874 states and 58556 transitions. [2020-02-10 20:08:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:52,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:52,920 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:08:52,920 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:08:52,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:08:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6211. [2020-02-10 20:08:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:08:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34101 transitions. [2020-02-10 20:08:53,561 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34101 transitions. Word has length 34 [2020-02-10 20:08:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:53,561 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34101 transitions. [2020-02-10 20:08:53,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34101 transitions. [2020-02-10 20:08:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:53,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:53,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:53,572 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2113144576, now seen corresponding path program 219 times [2020-02-10 20:08:53,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:53,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372325296] [2020-02-10 20:08:53,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:54,000 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:08:54,223 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:54,367 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:08:54,517 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:08:54,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 20:08:54,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372325296] [2020-02-10 20:08:54,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:54,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:54,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616652088] [2020-02-10 20:08:54,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:54,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:54,530 INFO L87 Difference]: Start difference. First operand 6211 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:08:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:54,916 INFO L93 Difference]: Finished difference Result 11869 states and 58546 transitions. [2020-02-10 20:08:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:54,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:54,944 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:08:54,944 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 20:08:54,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 20:08:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 20:08:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:08:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 20:08:55,584 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 20:08:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:55,584 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 20:08:55,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 20:08:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:55,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:55,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:55,594 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -812764646, now seen corresponding path program 220 times [2020-02-10 20:08:55,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:55,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480023929] [2020-02-10 20:08:55,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:56,137 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:56,284 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:08:56,438 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:56,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480023929] [2020-02-10 20:08:56,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:56,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:56,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971406317] [2020-02-10 20:08:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:56,450 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:08:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:56,900 INFO L93 Difference]: Finished difference Result 11870 states and 58541 transitions. [2020-02-10 20:08:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:56,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:56,930 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:08:56,930 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:08:56,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:08:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:08:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:08:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 20:08:57,567 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 20:08:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:57,567 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 20:08:57,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 20:08:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:57,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:57,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:57,578 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -395788736, now seen corresponding path program 221 times [2020-02-10 20:08:57,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:57,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413917030] [2020-02-10 20:08:57,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:58,280 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:08:58,436 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:08:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:58,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413917030] [2020-02-10 20:08:58,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:58,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:08:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450376709] [2020-02-10 20:08:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:08:58,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:08:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:58,451 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:08:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:58,938 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 20:08:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:08:58,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:08:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:58,967 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:08:58,968 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:08:58,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:08:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:08:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6219. [2020-02-10 20:08:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:08:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34109 transitions. [2020-02-10 20:08:59,610 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34109 transitions. Word has length 34 [2020-02-10 20:08:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:59,610 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34109 transitions. [2020-02-10 20:08:59,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:08:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34109 transitions. [2020-02-10 20:08:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:08:59,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:59,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:59,621 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1314824572, now seen corresponding path program 222 times [2020-02-10 20:08:59,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:59,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582632979] [2020-02-10 20:08:59,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:00,307 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:00,558 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:09:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:00,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582632979] [2020-02-10 20:09:00,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:00,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:00,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055866364] [2020-02-10 20:09:00,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:00,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:00,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:00,570 INFO L87 Difference]: Start difference. First operand 6219 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:09:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:00,904 INFO L93 Difference]: Finished difference Result 11874 states and 58542 transitions. [2020-02-10 20:09:00,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:00,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:00,935 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:09:00,935 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:09:00,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:09:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6204. [2020-02-10 20:09:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:09:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34074 transitions. [2020-02-10 20:09:01,574 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34074 transitions. Word has length 34 [2020-02-10 20:09:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:01,574 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34074 transitions. [2020-02-10 20:09:01,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34074 transitions. [2020-02-10 20:09:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:01,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:01,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:01,586 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash 691278486, now seen corresponding path program 223 times [2020-02-10 20:09:01,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:01,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748013652] [2020-02-10 20:09:01,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:02,138 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:09:02,278 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:09:02,423 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:02,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748013652] [2020-02-10 20:09:02,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:02,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:02,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064462341] [2020-02-10 20:09:02,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:02,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:02,435 INFO L87 Difference]: Start difference. First operand 6204 states and 34074 transitions. Second operand 13 states. [2020-02-10 20:09:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:02,724 INFO L93 Difference]: Finished difference Result 11873 states and 58555 transitions. [2020-02-10 20:09:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:02,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:02,754 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:09:02,754 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:09:02,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:09:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6218. [2020-02-10 20:09:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:09:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 20:09:03,403 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 20:09:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:03,404 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 20:09:03,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 20:09:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:03,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:03,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:03,415 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash 482815732, now seen corresponding path program 224 times [2020-02-10 20:09:03,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:03,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134545557] [2020-02-10 20:09:03,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:03,972 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:09:04,116 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:09:04,263 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:04,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134545557] [2020-02-10 20:09:04,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:04,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:04,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884005024] [2020-02-10 20:09:04,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:04,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:04,274 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:09:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:04,608 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 20:09:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:04,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:04,638 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:09:04,638 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 20:09:04,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 20:09:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6211. [2020-02-10 20:09:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:09:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 20:09:05,276 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 20:09:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:05,276 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 20:09:05,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 20:09:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:05,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:05,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:05,287 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2128071232, now seen corresponding path program 225 times [2020-02-10 20:09:05,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:05,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216404634] [2020-02-10 20:09:05,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:05,983 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:06,137 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:06,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216404634] [2020-02-10 20:09:06,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:06,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:06,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695403732] [2020-02-10 20:09:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:06,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:06,149 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:09:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:06,442 INFO L93 Difference]: Finished difference Result 11872 states and 58546 transitions. [2020-02-10 20:09:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:06,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:06,472 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:09:06,472 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:09:06,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:09:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6218. [2020-02-10 20:09:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:09:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 20:09:07,198 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 20:09:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:07,198 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 20:09:07,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 20:09:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:07,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:07,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:07,209 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash -711910924, now seen corresponding path program 226 times [2020-02-10 20:09:07,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:07,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161531476] [2020-02-10 20:09:07,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:07,900 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:08,045 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:08,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161531476] [2020-02-10 20:09:08,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:08,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:08,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014199418] [2020-02-10 20:09:08,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:08,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:08,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:08,056 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:09:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:08,367 INFO L93 Difference]: Finished difference Result 11874 states and 58543 transitions. [2020-02-10 20:09:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:08,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:08,398 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:09:08,398 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:09:08,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:09:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6211. [2020-02-10 20:09:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:09:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 20:09:09,036 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 20:09:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:09,036 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 20:09:09,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 20:09:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:09,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:09,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:09,048 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1434112320, now seen corresponding path program 227 times [2020-02-10 20:09:09,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:09,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105392079] [2020-02-10 20:09:09,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:09,615 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:09,755 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:09:09,906 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:09,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105392079] [2020-02-10 20:09:09,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:09,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:09,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652345985] [2020-02-10 20:09:09,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:09,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:09,919 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 20:09:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:10,263 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 20:09:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:10,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:10,291 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:09:10,291 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:09:10,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:09:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6220. [2020-02-10 20:09:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:09:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34104 transitions. [2020-02-10 20:09:10,934 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34104 transitions. Word has length 34 [2020-02-10 20:09:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:10,934 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34104 transitions. [2020-02-10 20:09:10,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34104 transitions. [2020-02-10 20:09:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:10,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:10,945 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1415678294, now seen corresponding path program 228 times [2020-02-10 20:09:10,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:10,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714071607] [2020-02-10 20:09:10,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:11,506 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:11,645 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:11,799 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:11,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714071607] [2020-02-10 20:09:11,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:11,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:11,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188628666] [2020-02-10 20:09:11,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:11,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:11,811 INFO L87 Difference]: Start difference. First operand 6220 states and 34104 transitions. Second operand 13 states. [2020-02-10 20:09:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:12,181 INFO L93 Difference]: Finished difference Result 11879 states and 58546 transitions. [2020-02-10 20:09:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:12,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:12,212 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:09:12,212 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:09:12,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:09:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 20:09:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:09:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34067 transitions. [2020-02-10 20:09:12,944 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34067 transitions. Word has length 34 [2020-02-10 20:09:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:12,944 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34067 transitions. [2020-02-10 20:09:12,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34067 transitions. [2020-02-10 20:09:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:12,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:12,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:12,956 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 681327382, now seen corresponding path program 229 times [2020-02-10 20:09:12,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:12,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210312133] [2020-02-10 20:09:12,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:13,524 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:13,670 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:13,820 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:09:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:13,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210312133] [2020-02-10 20:09:13,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:13,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:13,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289069810] [2020-02-10 20:09:13,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:13,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:13,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:13,832 INFO L87 Difference]: Start difference. First operand 6204 states and 34067 transitions. Second operand 13 states. [2020-02-10 20:09:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:14,184 INFO L93 Difference]: Finished difference Result 11868 states and 58537 transitions. [2020-02-10 20:09:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:14,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:14,214 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 20:09:14,214 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:09:14,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:09:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6218. [2020-02-10 20:09:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:09:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 20:09:14,856 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 20:09:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:14,856 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 20:09:14,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 20:09:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:14,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:14,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:14,868 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1981707312, now seen corresponding path program 230 times [2020-02-10 20:09:14,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:14,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668671067] [2020-02-10 20:09:14,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:15,429 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:15,575 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:15,727 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:09:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:15,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668671067] [2020-02-10 20:09:15,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:15,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:15,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134507746] [2020-02-10 20:09:15,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:15,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:15,739 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:09:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:16,102 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 20:09:16,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:16,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:16,130 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:09:16,131 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:09:16,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:09:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6211. [2020-02-10 20:09:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:09:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 20:09:16,771 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 20:09:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:16,771 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 20:09:16,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 20:09:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:16,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:16,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:16,782 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1869275908, now seen corresponding path program 231 times [2020-02-10 20:09:16,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:16,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292072579] [2020-02-10 20:09:16,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:17,467 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:17,613 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:17,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292072579] [2020-02-10 20:09:17,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:17,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:17,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100827779] [2020-02-10 20:09:17,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:17,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:17,625 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 20:09:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:18,079 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 20:09:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:18,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:18,107 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:09:18,108 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 20:09:18,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 20:09:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 20:09:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:09:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34100 transitions. [2020-02-10 20:09:18,751 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34100 transitions. Word has length 34 [2020-02-10 20:09:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:18,752 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34100 transitions. [2020-02-10 20:09:18,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34100 transitions. [2020-02-10 20:09:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:18,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:18,763 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -453115600, now seen corresponding path program 232 times [2020-02-10 20:09:18,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:18,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739504316] [2020-02-10 20:09:18,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:19,026 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 20:09:19,551 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:19,706 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:19,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 20:09:19,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739504316] [2020-02-10 20:09:19,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:19,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:19,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199982133] [2020-02-10 20:09:19,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:19,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:19,719 INFO L87 Difference]: Start difference. First operand 6218 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:09:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:20,167 INFO L93 Difference]: Finished difference Result 11871 states and 58529 transitions. [2020-02-10 20:09:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:20,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:20,197 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:09:20,197 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:09:20,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:09:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:09:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:09:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34080 transitions. [2020-02-10 20:09:20,834 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34080 transitions. Word has length 34 [2020-02-10 20:09:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:20,834 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34080 transitions. [2020-02-10 20:09:20,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34080 transitions. [2020-02-10 20:09:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:20,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:20,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:20,846 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1361963396, now seen corresponding path program 233 times [2020-02-10 20:09:20,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:20,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007828691] [2020-02-10 20:09:20,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:21,409 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:21,555 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:21,708 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:09:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:21,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007828691] [2020-02-10 20:09:21,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:21,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:21,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451663736] [2020-02-10 20:09:21,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:21,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:21,720 INFO L87 Difference]: Start difference. First operand 6211 states and 34080 transitions. Second operand 13 states. [2020-02-10 20:09:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:22,082 INFO L93 Difference]: Finished difference Result 11872 states and 58532 transitions. [2020-02-10 20:09:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:22,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:22,112 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:09:22,112 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:09:22,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:09:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 20:09:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:09:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34095 transitions. [2020-02-10 20:09:22,755 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34095 transitions. Word has length 34 [2020-02-10 20:09:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:22,755 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34095 transitions. [2020-02-10 20:09:22,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34095 transitions. [2020-02-10 20:09:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:22,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:22,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:22,766 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:22,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1203956566, now seen corresponding path program 234 times [2020-02-10 20:09:22,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:22,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917873565] [2020-02-10 20:09:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:23,319 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:23,465 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:23,620 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:09:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:23,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917873565] [2020-02-10 20:09:23,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:23,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:23,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838439994] [2020-02-10 20:09:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:23,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:23,632 INFO L87 Difference]: Start difference. First operand 6219 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:09:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:23,939 INFO L93 Difference]: Finished difference Result 11873 states and 58526 transitions. [2020-02-10 20:09:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:23,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:23,968 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:09:23,968 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:09:23,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:09:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6204. [2020-02-10 20:09:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:09:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34060 transitions. [2020-02-10 20:09:24,606 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34060 transitions. Word has length 34 [2020-02-10 20:09:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:24,607 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34060 transitions. [2020-02-10 20:09:24,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34060 transitions. [2020-02-10 20:09:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:24,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:24,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:24,618 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash -970365580, now seen corresponding path program 235 times [2020-02-10 20:09:24,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:24,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688022504] [2020-02-10 20:09:24,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:25,310 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:25,463 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:09:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:25,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688022504] [2020-02-10 20:09:25,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:25,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:25,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950678958] [2020-02-10 20:09:25,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:25,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:25,475 INFO L87 Difference]: Start difference. First operand 6204 states and 34060 transitions. Second operand 13 states. [2020-02-10 20:09:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:25,845 INFO L93 Difference]: Finished difference Result 11882 states and 58564 transitions. [2020-02-10 20:09:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:25,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:25,879 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 20:09:25,879 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:09:25,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:09:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6220. [2020-02-10 20:09:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:09:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34106 transitions. [2020-02-10 20:09:26,523 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34106 transitions. Word has length 34 [2020-02-10 20:09:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:26,523 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34106 transitions. [2020-02-10 20:09:26,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34106 transitions. [2020-02-10 20:09:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:26,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:26,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:26,534 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 740247728, now seen corresponding path program 236 times [2020-02-10 20:09:26,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:26,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405659615] [2020-02-10 20:09:26,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:27,095 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:09:27,239 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:27,390 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:09:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:27,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405659615] [2020-02-10 20:09:27,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457716354] [2020-02-10 20:09:27,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:27,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:27,402 INFO L87 Difference]: Start difference. First operand 6220 states and 34106 transitions. Second operand 13 states. [2020-02-10 20:09:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:27,807 INFO L93 Difference]: Finished difference Result 11880 states and 58552 transitions. [2020-02-10 20:09:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:27,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:27,837 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:09:27,837 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:09:27,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:09:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 20:09:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:09:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34083 transitions. [2020-02-10 20:09:28,475 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34083 transitions. Word has length 34 [2020-02-10 20:09:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:28,475 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34083 transitions. [2020-02-10 20:09:28,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34083 transitions. [2020-02-10 20:09:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:28,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:28,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:28,487 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1263741914, now seen corresponding path program 237 times [2020-02-10 20:09:28,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:28,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677206134] [2020-02-10 20:09:28,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:29,036 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:29,186 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:29,343 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:09:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677206134] [2020-02-10 20:09:29,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:29,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:29,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17861362] [2020-02-10 20:09:29,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:29,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:29,355 INFO L87 Difference]: Start difference. First operand 6212 states and 34083 transitions. Second operand 13 states. [2020-02-10 20:09:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:29,728 INFO L93 Difference]: Finished difference Result 11884 states and 58561 transitions. [2020-02-10 20:09:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:29,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:29,759 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:09:29,759 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:09:29,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:09:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6221. [2020-02-10 20:09:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:09:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34100 transitions. [2020-02-10 20:09:30,399 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34100 transitions. Word has length 34 [2020-02-10 20:09:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:30,400 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34100 transitions. [2020-02-10 20:09:30,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34100 transitions. [2020-02-10 20:09:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:30,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:30,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:30,411 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1245307888, now seen corresponding path program 238 times [2020-02-10 20:09:30,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:30,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227431109] [2020-02-10 20:09:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:30,979 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:31,125 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:31,277 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:09:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227431109] [2020-02-10 20:09:31,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:31,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:31,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001602071] [2020-02-10 20:09:31,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:31,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:31,289 INFO L87 Difference]: Start difference. First operand 6221 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:09:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:31,641 INFO L93 Difference]: Finished difference Result 11883 states and 58550 transitions. [2020-02-10 20:09:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:31,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:31,670 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:09:31,671 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:09:31,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:09:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6212. [2020-02-10 20:09:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:09:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34075 transitions. [2020-02-10 20:09:32,382 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34075 transitions. Word has length 34 [2020-02-10 20:09:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:32,383 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34075 transitions. [2020-02-10 20:09:32,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34075 transitions. [2020-02-10 20:09:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:32,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:32,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:32,394 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash 168792922, now seen corresponding path program 239 times [2020-02-10 20:09:32,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:32,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777641263] [2020-02-10 20:09:32,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:32,951 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:33,097 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:33,243 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:09:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:33,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777641263] [2020-02-10 20:09:33,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:33,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:33,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387376541] [2020-02-10 20:09:33,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:33,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:33,254 INFO L87 Difference]: Start difference. First operand 6212 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:09:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:33,574 INFO L93 Difference]: Finished difference Result 11879 states and 58542 transitions. [2020-02-10 20:09:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:33,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:33,604 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:09:33,604 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 20:09:33,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 20:09:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6220. [2020-02-10 20:09:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:09:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34090 transitions. [2020-02-10 20:09:34,247 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34090 transitions. Word has length 34 [2020-02-10 20:09:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:34,247 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34090 transitions. [2020-02-10 20:09:34,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34090 transitions. [2020-02-10 20:09:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:34,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:34,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:34,258 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1560254412, now seen corresponding path program 240 times [2020-02-10 20:09:34,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:34,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754459014] [2020-02-10 20:09:34,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:34,815 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:34,965 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:09:35,115 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:09:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:35,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754459014] [2020-02-10 20:09:35,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:35,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:35,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399495798] [2020-02-10 20:09:35,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:35,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:35,127 INFO L87 Difference]: Start difference. First operand 6220 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:09:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:35,485 INFO L93 Difference]: Finished difference Result 11880 states and 58536 transitions. [2020-02-10 20:09:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:35,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:35,515 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:09:35,515 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:09:35,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:09:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6185. [2020-02-10 20:09:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 20:09:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34018 transitions. [2020-02-10 20:09:36,154 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34018 transitions. Word has length 34 [2020-02-10 20:09:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:36,154 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34018 transitions. [2020-02-10 20:09:36,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34018 transitions. [2020-02-10 20:09:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:36,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:36,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:36,165 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1153765992, now seen corresponding path program 241 times [2020-02-10 20:09:36,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:36,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880181709] [2020-02-10 20:09:36,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:36,735 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:36,886 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:09:37,031 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:37,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880181709] [2020-02-10 20:09:37,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:37,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:37,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368134866] [2020-02-10 20:09:37,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:37,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:37,042 INFO L87 Difference]: Start difference. First operand 6185 states and 34018 transitions. Second operand 13 states. [2020-02-10 20:09:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:37,368 INFO L93 Difference]: Finished difference Result 11865 states and 58516 transitions. [2020-02-10 20:09:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:37,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:37,398 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 20:09:37,398 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:09:37,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:09:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6222. [2020-02-10 20:09:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:09:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34151 transitions. [2020-02-10 20:09:38,175 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34151 transitions. Word has length 34 [2020-02-10 20:09:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:38,175 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34151 transitions. [2020-02-10 20:09:38,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34151 transitions. [2020-02-10 20:09:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:38,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:38,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:38,186 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash 517299138, now seen corresponding path program 242 times [2020-02-10 20:09:38,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:38,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445098178] [2020-02-10 20:09:38,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:38,740 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:38,889 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:39,042 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:39,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445098178] [2020-02-10 20:09:39,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:39,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:39,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941967291] [2020-02-10 20:09:39,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:39,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:39,055 INFO L87 Difference]: Start difference. First operand 6222 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:09:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:39,545 INFO L93 Difference]: Finished difference Result 11863 states and 58502 transitions. [2020-02-10 20:09:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:39,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:39,576 INFO L225 Difference]: With dead ends: 11863 [2020-02-10 20:09:39,576 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:09:39,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:09:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 20:09:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:09:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34121 transitions. [2020-02-10 20:09:40,216 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34121 transitions. Word has length 34 [2020-02-10 20:09:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:40,216 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34121 transitions. [2020-02-10 20:09:40,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34121 transitions. [2020-02-10 20:09:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:40,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:40,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:40,228 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1377946600, now seen corresponding path program 243 times [2020-02-10 20:09:40,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:40,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274390770] [2020-02-10 20:09:40,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:40,777 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:09:40,921 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:09:41,072 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:41,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274390770] [2020-02-10 20:09:41,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:41,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:41,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302330290] [2020-02-10 20:09:41,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:41,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:41,083 INFO L87 Difference]: Start difference. First operand 6210 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:09:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:41,478 INFO L93 Difference]: Finished difference Result 11853 states and 58482 transitions. [2020-02-10 20:09:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:41,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:41,508 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:09:41,508 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:09:41,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:09:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6218. [2020-02-10 20:09:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:09:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34136 transitions. [2020-02-10 20:09:42,146 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34136 transitions. Word has length 34 [2020-02-10 20:09:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:42,146 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34136 transitions. [2020-02-10 20:09:42,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34136 transitions. [2020-02-10 20:09:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:42,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:42,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:42,157 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1932084412, now seen corresponding path program 244 times [2020-02-10 20:09:42,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:42,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242772023] [2020-02-10 20:09:42,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:42,701 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:09:42,853 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:09:42,999 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:43,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242772023] [2020-02-10 20:09:43,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:43,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:43,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406887471] [2020-02-10 20:09:43,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:43,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:43,010 INFO L87 Difference]: Start difference. First operand 6218 states and 34136 transitions. Second operand 13 states. [2020-02-10 20:09:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:43,372 INFO L93 Difference]: Finished difference Result 11858 states and 58484 transitions. [2020-02-10 20:09:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:43,373 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:43,402 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 20:09:43,402 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:09:43,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:09:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6210. [2020-02-10 20:09:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:09:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34113 transitions. [2020-02-10 20:09:44,047 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34113 transitions. Word has length 34 [2020-02-10 20:09:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:44,047 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34113 transitions. [2020-02-10 20:09:44,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34113 transitions. [2020-02-10 20:09:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:44,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:44,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:44,058 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash 366417406, now seen corresponding path program 245 times [2020-02-10 20:09:44,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:44,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232295694] [2020-02-10 20:09:44,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:44,691 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:09:44,842 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:09:44,998 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:45,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232295694] [2020-02-10 20:09:45,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:45,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:45,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477206130] [2020-02-10 20:09:45,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:45,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:45,010 INFO L87 Difference]: Start difference. First operand 6210 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:09:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:45,303 INFO L93 Difference]: Finished difference Result 11850 states and 58469 transitions. [2020-02-10 20:09:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:45,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:45,333 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 20:09:45,333 INFO L226 Difference]: Without dead ends: 11831 [2020-02-10 20:09:45,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11831 states. [2020-02-10 20:09:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11831 to 6217. [2020-02-10 20:09:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:09:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34126 transitions. [2020-02-10 20:09:45,970 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34126 transitions. Word has length 34 [2020-02-10 20:09:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:45,970 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34126 transitions. [2020-02-10 20:09:45,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34126 transitions. [2020-02-10 20:09:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:45,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:45,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:45,983 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash 157954652, now seen corresponding path program 246 times [2020-02-10 20:09:45,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:45,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642023477] [2020-02-10 20:09:45,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:46,659 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:46,809 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642023477] [2020-02-10 20:09:46,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:46,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:46,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183692226] [2020-02-10 20:09:46,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:46,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:46,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:46,822 INFO L87 Difference]: Start difference. First operand 6217 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:09:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:47,120 INFO L93 Difference]: Finished difference Result 11853 states and 58468 transitions. [2020-02-10 20:09:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:47,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:47,151 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:09:47,152 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:09:47,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:09:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6201. [2020-02-10 20:09:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:09:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34090 transitions. [2020-02-10 20:09:47,808 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34090 transitions. Word has length 34 [2020-02-10 20:09:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:47,808 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34090 transitions. [2020-02-10 20:09:47,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34090 transitions. [2020-02-10 20:09:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:47,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:47,819 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 747969188, now seen corresponding path program 247 times [2020-02-10 20:09:47,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:47,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459383198] [2020-02-10 20:09:47,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:48,360 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:48,514 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:09:48,664 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:09:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:48,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459383198] [2020-02-10 20:09:48,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:48,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:48,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969822779] [2020-02-10 20:09:48,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:48,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:48,677 INFO L87 Difference]: Start difference. First operand 6201 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:09:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:48,952 INFO L93 Difference]: Finished difference Result 11861 states and 58496 transitions. [2020-02-10 20:09:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:48,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:48,982 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:09:48,982 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:09:48,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:09:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:09:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6221. [2020-02-10 20:09:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:09:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34139 transitions. [2020-02-10 20:09:49,624 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34139 transitions. Word has length 34 [2020-02-10 20:09:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:49,624 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34139 transitions. [2020-02-10 20:09:49,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:09:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34139 transitions. [2020-02-10 20:09:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:09:49,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:49,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:49,635 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 111502334, now seen corresponding path program 248 times [2020-02-10 20:09:49,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:49,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866455817] [2020-02-10 20:09:49,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:50,185 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:50,336 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:09:50,490 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:09:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:50,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866455817] [2020-02-10 20:09:50,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:50,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:09:50,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879891185] [2020-02-10 20:09:50,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:09:50,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:09:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:50,504 INFO L87 Difference]: Start difference. First operand 6221 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:09:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:50,855 INFO L93 Difference]: Finished difference Result 11859 states and 58482 transitions. [2020-02-10 20:09:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:09:50,856 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:09:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:50,885 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 20:09:50,885 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 20:09:50,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 Received shutdown request... [2020-02-10 20:09:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 20:09:51,497 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:09:51,500 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:09:51,500 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:09:51 BasicIcfg [2020-02-10 20:09:51,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:09:51,501 INFO L168 Benchmark]: Toolchain (without parser) took 733138.50 ms. Allocated memory was 144.7 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 119.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,501 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,501 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,502 INFO L168 Benchmark]: RCFGBuilder took 392.66 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,502 INFO L168 Benchmark]: TraceAbstraction took 732669.68 ms. Allocated memory was 144.7 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 100.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2020-02-10 20:09:51,502 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.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 27.65 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.66 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 732669.68 ms. Allocated memory was 144.7 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 100.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 20.9s, 92 ProgramPointsBefore, 80 ProgramPointsAfterwards, 168 TransitionsBefore, 156 TransitionsAfterwards, 5060 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1375 CheckedPairsTotal, 12 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 732.3s, OverallIterations: 258, TraceHistogramMax: 1, AutomataDifference: 117.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 121.2s, HoareTripleCheckerStatistics: 47403 SDtfs, 72165 SDslu, 136389 SDs, 0 SdLazy, 36030 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3254 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 2986 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 232.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179196occurred 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: 250.5s AutomataMinimizationTime, 258 MinimizatonAttempts, 1391846 StatesRemovedByMinimization, 247 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 216.8s InterpolantComputationTime, 8772 NumberOfCodeBlocks, 8772 NumberOfCodeBlocksAsserted, 258 NumberOfCheckSat, 8514 ConstructedInterpolants, 0 QuantifiedInterpolants, 12111429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 258 InterpolantComputations, 258 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