/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 18:02:25,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:02:25,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:02:25,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:02:25,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:02:25,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:02:25,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:02:25,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:02:25,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:02:25,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:02:25,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:02:25,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:02:25,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:02:25,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:02:25,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:02:25,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:02:25,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:02:25,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:02:25,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:02:25,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:02:25,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:02:25,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:02:25,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:02:25,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:02:25,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:02:25,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:02:25,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:02:25,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:02:25,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:02:25,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:02:25,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:02:25,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:02:25,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:02:25,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:02:25,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:02:25,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:02:25,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:02:25,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:02:25,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:02:25,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:02:25,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:02:25,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-01-16 18:02:25,315 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:02:25,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:02:25,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:02:25,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:02:25,318 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:02:25,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:02:25,318 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:02:25,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:02:25,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:02:25,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:02:25,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:02:25,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:02:25,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:02:25,323 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:02:25,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:02:25,323 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:02:25,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:02:25,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:02:25,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:02:25,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:02:25,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:02:25,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:02:25,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:02:25,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:02:25,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:02:25,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:02:25,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:02:25,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:02:25,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-01-16 18:02:25,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:02:25,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:02:25,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:02:25,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:02:25,624 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:02:25,624 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:02:25,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl [2020-01-16 18:02:25,625 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl' [2020-01-16 18:02:25,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:02:25,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:02:25,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:02:25,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:02:25,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:02:25,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:02:25,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:02:25,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:02:25,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:02:25,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/1) ... [2020-01-16 18:02:25,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:02:25,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:02:25,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:02:25,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:02:25,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (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-01-16 18:02:25,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:02:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:02:25,806 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:02:25,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:02:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:02:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:02:25,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:02:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:02:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:02:25,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 18:02:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 18:02:25,808 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 18:02:25,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:02:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:02:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:02:25,809 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:02:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:02:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:02:25,810 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 18:02:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 18:02:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 18:02:25,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-01-16 18:02:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-01-16 18:02:25,811 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-01-16 18:02:25,812 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-01-16 18:02:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-01-16 18:02:25,813 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-01-16 18:02:25,815 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 18:02:26,039 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:02:26,040 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:02:26,041 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:02:26 BoogieIcfgContainer [2020-01-16 18:02:26,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:02:26,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:02:26,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:02:26,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:02:26,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:02:25" (1/2) ... [2020-01-16 18:02:26,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d29d0 and model type example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:02:26, skipping insertion in model container [2020-01-16 18:02:26,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:02:26" (2/2) ... [2020-01-16 18:02:26,049 INFO L109 eAbstractionObserver]: Analyzing ICFG example_8.bpl [2020-01-16 18:02:26,059 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:02:26,059 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:02:26,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:02:26,069 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:02:26,283 INFO L250 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-01-16 18:02:26,301 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:02:26,302 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:02:26,302 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:02:26,302 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:02:26,302 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:02:26,303 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:02:26,303 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:02:26,303 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:02:26,318 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions [2020-01-16 18:02:26,320 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-01-16 18:02:26,704 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-01-16 18:02:26,705 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-01-16 18:02:26,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-01-16 18:02:26,754 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-01-16 18:02:26,981 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-01-16 18:02:26,981 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-01-16 18:02:26,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-01-16 18:02:27,016 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1904 [2020-01-16 18:02:27,018 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-01-16 18:02:27,188 INFO L206 etLargeBlockEncoding]: Checked pairs total: 532 [2020-01-16 18:02:27,188 INFO L214 etLargeBlockEncoding]: Total number of compositions: 9 [2020-01-16 18:02:27,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 90 transitions [2020-01-16 18:02:27,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6818 states. [2020-01-16 18:02:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states. [2020-01-16 18:02:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:27,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:27,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:27,970 INFO L426 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1176015965, now seen corresponding path program 1 times [2020-01-16 18:02:27,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:27,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834448933] [2020-01-16 18:02:27,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:28,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834448933] [2020-01-16 18:02:28,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:28,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:28,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713548349] [2020-01-16 18:02:28,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:28,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:28,227 INFO L87 Difference]: Start difference. First operand 6818 states. Second operand 3 states. [2020-01-16 18:02:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:28,387 INFO L93 Difference]: Finished difference Result 6690 states and 34994 transitions. [2020-01-16 18:02:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:28,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:28,503 INFO L225 Difference]: With dead ends: 6690 [2020-01-16 18:02:28,504 INFO L226 Difference]: Without dead ends: 6689 [2020-01-16 18:02:28,507 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-01-16 18:02:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2020-01-16 18:02:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2020-01-16 18:02:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2020-01-16 18:02:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 34993 transitions. [2020-01-16 18:02:29,122 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 34993 transitions. Word has length 25 [2020-01-16 18:02:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:29,124 INFO L478 AbstractCegarLoop]: Abstraction has 6689 states and 34993 transitions. [2020-01-16 18:02:29,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 34993 transitions. [2020-01-16 18:02:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:29,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:29,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] [2020-01-16 18:02:29,155 INFO L426 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1467806563, now seen corresponding path program 1 times [2020-01-16 18:02:29,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:29,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075977768] [2020-01-16 18:02:29,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:29,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-01-16 18:02:29,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075977768] [2020-01-16 18:02:29,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:29,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:29,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89551871] [2020-01-16 18:02:29,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:29,233 INFO L87 Difference]: Start difference. First operand 6689 states and 34993 transitions. Second operand 3 states. [2020-01-16 18:02:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:29,360 INFO L93 Difference]: Finished difference Result 4881 states and 24065 transitions. [2020-01-16 18:02:29,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:29,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:29,453 INFO L225 Difference]: With dead ends: 4881 [2020-01-16 18:02:29,453 INFO L226 Difference]: Without dead ends: 4881 [2020-01-16 18:02:29,455 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-01-16 18:02:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2020-01-16 18:02:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2020-01-16 18:02:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2020-01-16 18:02:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 24065 transitions. [2020-01-16 18:02:29,711 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 24065 transitions. Word has length 25 [2020-01-16 18:02:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:29,712 INFO L478 AbstractCegarLoop]: Abstraction has 4881 states and 24065 transitions. [2020-01-16 18:02:29,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 24065 transitions. [2020-01-16 18:02:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:29,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:29,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:29,748 INFO L426 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash -795426887, now seen corresponding path program 1 times [2020-01-16 18:02:29,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:29,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078466482] [2020-01-16 18:02:29,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:29,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078466482] [2020-01-16 18:02:29,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:29,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:29,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709477453] [2020-01-16 18:02:29,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:29,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:29,828 INFO L87 Difference]: Start difference. First operand 4881 states and 24065 transitions. Second operand 3 states. [2020-01-16 18:02:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:30,284 INFO L93 Difference]: Finished difference Result 3205 states and 15221 transitions. [2020-01-16 18:02:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:30,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:30,302 INFO L225 Difference]: With dead ends: 3205 [2020-01-16 18:02:30,302 INFO L226 Difference]: Without dead ends: 3205 [2020-01-16 18:02:30,303 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-01-16 18:02:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2020-01-16 18:02:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2020-01-16 18:02:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-01-16 18:02:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 15221 transitions. [2020-01-16 18:02:30,460 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 15221 transitions. Word has length 25 [2020-01-16 18:02:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:30,461 INFO L478 AbstractCegarLoop]: Abstraction has 3205 states and 15221 transitions. [2020-01-16 18:02:30,461 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 15221 transitions. [2020-01-16 18:02:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:30,479 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:30,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:30,480 INFO L426 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash 694354523, now seen corresponding path program 1 times [2020-01-16 18:02:30,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:30,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078918116] [2020-01-16 18:02:30,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:30,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-01-16 18:02:30,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078918116] [2020-01-16 18:02:30,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:30,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:30,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346110111] [2020-01-16 18:02:30,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:30,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:30,556 INFO L87 Difference]: Start difference. First operand 3205 states and 15221 transitions. Second operand 3 states. [2020-01-16 18:02:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:30,613 INFO L93 Difference]: Finished difference Result 2757 states and 12469 transitions. [2020-01-16 18:02:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:30,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:30,628 INFO L225 Difference]: With dead ends: 2757 [2020-01-16 18:02:30,628 INFO L226 Difference]: Without dead ends: 2757 [2020-01-16 18:02:30,628 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-01-16 18:02:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2020-01-16 18:02:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2020-01-16 18:02:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2020-01-16 18:02:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 12469 transitions. [2020-01-16 18:02:30,781 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 12469 transitions. Word has length 25 [2020-01-16 18:02:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:30,782 INFO L478 AbstractCegarLoop]: Abstraction has 2757 states and 12469 transitions. [2020-01-16 18:02:30,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 12469 transitions. [2020-01-16 18:02:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:30,796 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:30,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:30,797 INFO L426 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1749585931, now seen corresponding path program 1 times [2020-01-16 18:02:30,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:30,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230820323] [2020-01-16 18:02:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:30,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-01-16 18:02:30,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230820323] [2020-01-16 18:02:30,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:30,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:30,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664192393] [2020-01-16 18:02:30,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:30,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:30,866 INFO L87 Difference]: Start difference. First operand 2757 states and 12469 transitions. Second operand 3 states. [2020-01-16 18:02:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:30,914 INFO L93 Difference]: Finished difference Result 1773 states and 7633 transitions. [2020-01-16 18:02:30,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:30,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:30,931 INFO L225 Difference]: With dead ends: 1773 [2020-01-16 18:02:30,932 INFO L226 Difference]: Without dead ends: 1773 [2020-01-16 18:02:30,933 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-01-16 18:02:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-01-16 18:02:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2020-01-16 18:02:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-01-16 18:02:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 7633 transitions. [2020-01-16 18:02:31,046 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 7633 transitions. Word has length 25 [2020-01-16 18:02:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:31,047 INFO L478 AbstractCegarLoop]: Abstraction has 1773 states and 7633 transitions. [2020-01-16 18:02:31,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 7633 transitions. [2020-01-16 18:02:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:31,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:31,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:31,055 INFO L426 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:31,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1906045009, now seen corresponding path program 1 times [2020-01-16 18:02:31,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:31,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447938814] [2020-01-16 18:02:31,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:31,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447938814] [2020-01-16 18:02:31,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:31,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:31,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362307113] [2020-01-16 18:02:31,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:31,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:31,111 INFO L87 Difference]: Start difference. First operand 1773 states and 7633 transitions. Second operand 3 states. [2020-01-16 18:02:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:31,137 INFO L93 Difference]: Finished difference Result 1119 states and 4673 transitions. [2020-01-16 18:02:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:31,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:31,147 INFO L225 Difference]: With dead ends: 1119 [2020-01-16 18:02:31,147 INFO L226 Difference]: Without dead ends: 1119 [2020-01-16 18:02:31,148 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-01-16 18:02:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-01-16 18:02:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-01-16 18:02:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-01-16 18:02:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 4673 transitions. [2020-01-16 18:02:31,225 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 4673 transitions. Word has length 25 [2020-01-16 18:02:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:31,225 INFO L478 AbstractCegarLoop]: Abstraction has 1119 states and 4673 transitions. [2020-01-16 18:02:31,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 4673 transitions. [2020-01-16 18:02:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:31,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:31,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:31,231 INFO L426 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash -389208845, now seen corresponding path program 1 times [2020-01-16 18:02:31,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:31,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764506465] [2020-01-16 18:02:31,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:31,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764506465] [2020-01-16 18:02:31,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:31,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:02:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960828215] [2020-01-16 18:02:31,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:02:31,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:02:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:02:31,258 INFO L87 Difference]: Start difference. First operand 1119 states and 4673 transitions. Second operand 3 states. [2020-01-16 18:02:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:31,277 INFO L93 Difference]: Finished difference Result 767 states and 3073 transitions. [2020-01-16 18:02:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:02:31,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-01-16 18:02:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:31,281 INFO L225 Difference]: With dead ends: 767 [2020-01-16 18:02:31,281 INFO L226 Difference]: Without dead ends: 767 [2020-01-16 18:02:31,283 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-01-16 18:02:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-01-16 18:02:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2020-01-16 18:02:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-01-16 18:02:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3073 transitions. [2020-01-16 18:02:31,332 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3073 transitions. Word has length 25 [2020-01-16 18:02:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:31,334 INFO L478 AbstractCegarLoop]: Abstraction has 767 states and 3073 transitions. [2020-01-16 18:02:31,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:02:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3073 transitions. [2020-01-16 18:02:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:31,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:31,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:31,338 INFO L426 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash -377910571, now seen corresponding path program 1 times [2020-01-16 18:02:31,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:31,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987663652] [2020-01-16 18:02:31,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:31,852 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2020-01-16 18:02:32,028 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:02:32,162 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:32,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987663652] [2020-01-16 18:02:32,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:32,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:32,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941999647] [2020-01-16 18:02:32,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:32,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:32,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:32,176 INFO L87 Difference]: Start difference. First operand 767 states and 3073 transitions. Second operand 10 states. [2020-01-16 18:02:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:32,380 INFO L93 Difference]: Finished difference Result 1367 states and 4850 transitions. [2020-01-16 18:02:32,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:32,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:32,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:32,386 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:02:32,387 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:02:32,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:02:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-01-16 18:02:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:02:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-01-16 18:02:32,437 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-01-16 18:02:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:32,437 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-01-16 18:02:32,437 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-01-16 18:02:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:32,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:32,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:32,441 INFO L426 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash 592341043, now seen corresponding path program 2 times [2020-01-16 18:02:32,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:32,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797829370] [2020-01-16 18:02:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:33,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797829370] [2020-01-16 18:02:33,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:33,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:33,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061447111] [2020-01-16 18:02:33,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:33,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:33,027 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:02:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:33,229 INFO L93 Difference]: Finished difference Result 1369 states and 4850 transitions. [2020-01-16 18:02:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:33,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:33,235 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:02:33,235 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:02:33,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:02:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:02:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3153 transitions. [2020-01-16 18:02:33,278 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3153 transitions. Word has length 25 [2020-01-16 18:02:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:33,279 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3153 transitions. [2020-01-16 18:02:33,279 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3153 transitions. [2020-01-16 18:02:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:33,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:33,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:33,282 INFO L426 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:33,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1548123507, now seen corresponding path program 3 times [2020-01-16 18:02:33,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:33,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616610130] [2020-01-16 18:02:33,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:33,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616610130] [2020-01-16 18:02:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:33,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:33,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626722646] [2020-01-16 18:02:33,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:33,790 INFO L87 Difference]: Start difference. First operand 785 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:02:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:33,977 INFO L93 Difference]: Finished difference Result 1363 states and 4838 transitions. [2020-01-16 18:02:33,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:33,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:33,983 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:02:33,983 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:02:33,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:02:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-01-16 18:02:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3158 transitions. [2020-01-16 18:02:34,028 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3158 transitions. Word has length 25 [2020-01-16 18:02:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:34,030 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3158 transitions. [2020-01-16 18:02:34,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3158 transitions. [2020-01-16 18:02:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:34,033 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:34,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:34,034 INFO L426 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1766089071, now seen corresponding path program 4 times [2020-01-16 18:02:34,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:34,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029214689] [2020-01-16 18:02:34,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:34,663 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:02:34,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-01-16 18:02:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029214689] [2020-01-16 18:02:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:34,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:34,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791710144] [2020-01-16 18:02:34,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:34,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:34,673 INFO L87 Difference]: Start difference. First operand 788 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:02:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:34,869 INFO L93 Difference]: Finished difference Result 1362 states and 4833 transitions. [2020-01-16 18:02:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:34,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:34,876 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:02:34,877 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:02:34,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:02:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-01-16 18:02:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-01-16 18:02:34,933 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-01-16 18:02:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:34,934 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-01-16 18:02:34,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-01-16 18:02:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:34,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:34,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] [2020-01-16 18:02:34,936 INFO L426 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 930966229, now seen corresponding path program 5 times [2020-01-16 18:02:34,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:34,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457910995] [2020-01-16 18:02:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:35,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457910995] [2020-01-16 18:02:35,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:35,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:35,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183051189] [2020-01-16 18:02:35,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:35,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:35,478 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:02:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:35,669 INFO L93 Difference]: Finished difference Result 1367 states and 4843 transitions. [2020-01-16 18:02:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:35,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:35,680 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:02:35,681 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:02:35,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:02:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:02:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:02:35,724 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:02:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:35,725 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:02:35,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:02:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:35,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:35,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:35,728 INFO L426 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1753060109, now seen corresponding path program 6 times [2020-01-16 18:02:35,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:35,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124477813] [2020-01-16 18:02:35,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:36,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-01-16 18:02:36,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124477813] [2020-01-16 18:02:36,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:36,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:36,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540017881] [2020-01-16 18:02:36,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:36,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:36,227 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:02:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:36,416 INFO L93 Difference]: Finished difference Result 1364 states and 4834 transitions. [2020-01-16 18:02:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:36,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:36,423 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:02:36,423 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:02:36,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:02:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-01-16 18:02:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:02:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3142 transitions. [2020-01-16 18:02:36,467 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3142 transitions. Word has length 25 [2020-01-16 18:02:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:36,467 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3142 transitions. [2020-01-16 18:02:36,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3142 transitions. [2020-01-16 18:02:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:36,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:36,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] [2020-01-16 18:02:36,470 INFO L426 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash -800396297, now seen corresponding path program 7 times [2020-01-16 18:02:36,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:36,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318438988] [2020-01-16 18:02:36,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:36,980 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:36,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-01-16 18:02:36,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318438988] [2020-01-16 18:02:36,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:36,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:36,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176986140] [2020-01-16 18:02:36,988 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:36,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:36,989 INFO L87 Difference]: Start difference. First operand 782 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:02:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:37,212 INFO L93 Difference]: Finished difference Result 1376 states and 4871 transitions. [2020-01-16 18:02:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:37,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:37,218 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:02:37,218 INFO L226 Difference]: Without dead ends: 1363 [2020-01-16 18:02:37,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-01-16 18:02:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 790. [2020-01-16 18:02:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:02:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3164 transitions. [2020-01-16 18:02:37,260 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3164 transitions. Word has length 25 [2020-01-16 18:02:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:37,261 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3164 transitions. [2020-01-16 18:02:37,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3164 transitions. [2020-01-16 18:02:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:37,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:37,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] [2020-01-16 18:02:37,264 INFO L426 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash 169855317, now seen corresponding path program 8 times [2020-01-16 18:02:37,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:37,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030081752] [2020-01-16 18:02:37,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:37,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030081752] [2020-01-16 18:02:37,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:37,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:37,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182889970] [2020-01-16 18:02:37,735 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:37,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:37,736 INFO L87 Difference]: Start difference. First operand 790 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:02:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:37,908 INFO L93 Difference]: Finished difference Result 1378 states and 4871 transitions. [2020-01-16 18:02:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:37,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:37,913 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:02:37,913 INFO L226 Difference]: Without dead ends: 1359 [2020-01-16 18:02:37,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-01-16 18:02:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 786. [2020-01-16 18:02:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:02:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3153 transitions. [2020-01-16 18:02:37,952 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3153 transitions. Word has length 25 [2020-01-16 18:02:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:37,953 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3153 transitions. [2020-01-16 18:02:37,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3153 transitions. [2020-01-16 18:02:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:37,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:37,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:37,955 INFO L426 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1243295437, now seen corresponding path program 9 times [2020-01-16 18:02:37,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:37,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913628360] [2020-01-16 18:02:37,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:38,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913628360] [2020-01-16 18:02:38,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:38,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:38,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224455083] [2020-01-16 18:02:38,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:38,448 INFO L87 Difference]: Start difference. First operand 786 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:02:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:38,607 INFO L93 Difference]: Finished difference Result 1377 states and 4869 transitions. [2020-01-16 18:02:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:38,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:38,611 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:02:38,612 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:02:38,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:02:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-01-16 18:02:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:02:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3160 transitions. [2020-01-16 18:02:38,650 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3160 transitions. Word has length 25 [2020-01-16 18:02:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:38,650 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3160 transitions. [2020-01-16 18:02:38,650 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3160 transitions. [2020-01-16 18:02:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:38,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:38,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:38,653 INFO L426 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash -252037615, now seen corresponding path program 10 times [2020-01-16 18:02:38,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:38,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237988530] [2020-01-16 18:02:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:39,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237988530] [2020-01-16 18:02:39,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:39,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:39,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441336087] [2020-01-16 18:02:39,123 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:39,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:39,124 INFO L87 Difference]: Start difference. First operand 790 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:02:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:39,316 INFO L93 Difference]: Finished difference Result 1380 states and 4871 transitions. [2020-01-16 18:02:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:39,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:39,319 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:02:39,320 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:02:39,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:02:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-01-16 18:02:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:02:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-01-16 18:02:39,360 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-01-16 18:02:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:39,361 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-01-16 18:02:39,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-01-16 18:02:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:39,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:39,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:39,364 INFO L426 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 834076727, now seen corresponding path program 11 times [2020-01-16 18:02:39,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:39,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439997659] [2020-01-16 18:02:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:39,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439997659] [2020-01-16 18:02:39,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:39,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718484175] [2020-01-16 18:02:39,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:39,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:39,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:39,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:39,834 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:02:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:39,966 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-01-16 18:02:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:39,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:39,970 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:02:39,970 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:02:39,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:02:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 792. [2020-01-16 18:02:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:02:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3160 transitions. [2020-01-16 18:02:40,008 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3160 transitions. Word has length 25 [2020-01-16 18:02:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:40,008 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3160 transitions. [2020-01-16 18:02:40,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3160 transitions. [2020-01-16 18:02:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:40,010 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:40,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:40,011 INFO L426 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -239008653, now seen corresponding path program 12 times [2020-01-16 18:02:40,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:40,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074503315] [2020-01-16 18:02:40,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:40,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074503315] [2020-01-16 18:02:40,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:40,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:40,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116182467] [2020-01-16 18:02:40,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:40,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:40,470 INFO L87 Difference]: Start difference. First operand 792 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:02:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:40,656 INFO L93 Difference]: Finished difference Result 1384 states and 4875 transitions. [2020-01-16 18:02:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:40,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:40,659 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:02:40,659 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:02:40,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:02:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 782. [2020-01-16 18:02:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:02:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-01-16 18:02:40,689 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-01-16 18:02:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:40,690 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-01-16 18:02:40,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-01-16 18:02:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:40,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:40,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:40,692 INFO L426 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash 703152055, now seen corresponding path program 13 times [2020-01-16 18:02:40,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:40,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787582011] [2020-01-16 18:02:40,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:41,188 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:41,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787582011] [2020-01-16 18:02:41,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:41,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:41,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892197458] [2020-01-16 18:02:41,196 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:41,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:41,197 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:02:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:41,369 INFO L93 Difference]: Finished difference Result 1364 states and 4837 transitions. [2020-01-16 18:02:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:41,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:41,373 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:02:41,374 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:02:41,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:02:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-01-16 18:02:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:02:41,406 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:02:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:41,407 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:02:41,407 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:02:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:41,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:41,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:41,409 INFO L426 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1683906773, now seen corresponding path program 14 times [2020-01-16 18:02:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:41,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416959445] [2020-01-16 18:02:41,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:41,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-01-16 18:02:41,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416959445] [2020-01-16 18:02:41,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:41,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:41,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66842354] [2020-01-16 18:02:41,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:41,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:41,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:41,886 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:02:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:42,070 INFO L93 Difference]: Finished difference Result 1363 states and 4832 transitions. [2020-01-16 18:02:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:42,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:42,074 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:02:42,074 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:02:42,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:02:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-01-16 18:02:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-01-16 18:02:42,110 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-01-16 18:02:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:42,110 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-01-16 18:02:42,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-01-16 18:02:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:42,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:42,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:42,113 INFO L426 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1665781163, now seen corresponding path program 15 times [2020-01-16 18:02:42,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:42,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880876568] [2020-01-16 18:02:42,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:42,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880876568] [2020-01-16 18:02:42,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:42,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:42,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674014219] [2020-01-16 18:02:42,575 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:42,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:42,576 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:02:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:42,761 INFO L93 Difference]: Finished difference Result 1369 states and 4845 transitions. [2020-01-16 18:02:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:42,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:42,764 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:02:42,764 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:02:42,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:02:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 789. [2020-01-16 18:02:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:02:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:02:42,795 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:02:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:42,795 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:02:42,795 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:02:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:42,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:42,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] [2020-01-16 18:02:42,798 INFO L426 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -674523341, now seen corresponding path program 16 times [2020-01-16 18:02:42,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:42,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557166216] [2020-01-16 18:02:42,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:43,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557166216] [2020-01-16 18:02:43,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:43,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:43,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23009348] [2020-01-16 18:02:43,250 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:43,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:43,251 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:02:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:43,422 INFO L93 Difference]: Finished difference Result 1372 states and 4847 transitions. [2020-01-16 18:02:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:43,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:43,426 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:02:43,426 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:02:43,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:02:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 785. [2020-01-16 18:02:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:02:43,454 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:02:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:43,454 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:02:43,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:02:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:43,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:43,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:43,456 INFO L426 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1946839113, now seen corresponding path program 17 times [2020-01-16 18:02:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:43,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906665068] [2020-01-16 18:02:43,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:43,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906665068] [2020-01-16 18:02:43,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:43,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:43,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045551661] [2020-01-16 18:02:43,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:43,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:43,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:43,982 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:02:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:44,147 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-01-16 18:02:44,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:44,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:44,151 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:02:44,151 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:02:44,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:02:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-01-16 18:02:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:02:44,186 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:02:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:44,186 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:02:44,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:02:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:44,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:44,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] [2020-01-16 18:02:44,189 INFO L426 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -335898155, now seen corresponding path program 18 times [2020-01-16 18:02:44,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:44,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899841529] [2020-01-16 18:02:44,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:44,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-01-16 18:02:44,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899841529] [2020-01-16 18:02:44,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:44,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:44,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23905916] [2020-01-16 18:02:44,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:44,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:44,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:44,657 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:02:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:44,824 INFO L93 Difference]: Finished difference Result 1370 states and 4840 transitions. [2020-01-16 18:02:44,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:44,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:44,828 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:02:44,829 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:02:44,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:02:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 782. [2020-01-16 18:02:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:02:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-01-16 18:02:44,859 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-01-16 18:02:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:44,859 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-01-16 18:02:44,859 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-01-16 18:02:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:44,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:44,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:44,862 INFO L426 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 46993459, now seen corresponding path program 19 times [2020-01-16 18:02:44,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:44,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412289501] [2020-01-16 18:02:44,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:45,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-01-16 18:02:45,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412289501] [2020-01-16 18:02:45,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:45,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:45,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136346071] [2020-01-16 18:02:45,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:45,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:45,355 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:02:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:45,519 INFO L93 Difference]: Finished difference Result 1372 states and 4852 transitions. [2020-01-16 18:02:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:45,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:45,524 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:02:45,524 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:02:45,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:02:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-01-16 18:02:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:02:45,552 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:02:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:45,552 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:02:45,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:02:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:45,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:45,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] [2020-01-16 18:02:45,554 INFO L426 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1657934417, now seen corresponding path program 20 times [2020-01-16 18:02:45,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:45,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435680408] [2020-01-16 18:02:45,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:46,062 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:02:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:46,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435680408] [2020-01-16 18:02:46,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:46,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:46,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929977516] [2020-01-16 18:02:46,070 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:46,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:46,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:46,070 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:02:46,293 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-01-16 18:02:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:46,307 INFO L93 Difference]: Finished difference Result 1369 states and 4843 transitions. [2020-01-16 18:02:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:46,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:46,311 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:02:46,311 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:02:46,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:02:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 785. [2020-01-16 18:02:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:02:46,346 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:02:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:46,347 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:02:46,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:02:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:46,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:46,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] [2020-01-16 18:02:46,350 INFO L426 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1553444395, now seen corresponding path program 21 times [2020-01-16 18:02:46,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:46,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514141853] [2020-01-16 18:02:46,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:46,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-01-16 18:02:46,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514141853] [2020-01-16 18:02:46,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:46,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:46,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536206626] [2020-01-16 18:02:46,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:46,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:46,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:46,832 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:02:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:46,983 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2020-01-16 18:02:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:46,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:46,986 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:02:46,986 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:02:46,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:02:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 791. [2020-01-16 18:02:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:02:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:02:47,013 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:02:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:47,013 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:02:47,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:02:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:47,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:47,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:47,016 INFO L426 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1668437521, now seen corresponding path program 22 times [2020-01-16 18:02:47,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:47,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327272463] [2020-01-16 18:02:47,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:47,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327272463] [2020-01-16 18:02:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:47,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863483548] [2020-01-16 18:02:47,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:47,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:47,497 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:02:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:47,660 INFO L93 Difference]: Finished difference Result 1380 states and 4862 transitions. [2020-01-16 18:02:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:47,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:47,664 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:02:47,664 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:02:47,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:02:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-01-16 18:02:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:02:47,691 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:02:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:47,691 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:02:47,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:02:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:47,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:47,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:47,694 INFO L426 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1542941291, now seen corresponding path program 23 times [2020-01-16 18:02:47,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:47,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095557058] [2020-01-16 18:02:47,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:48,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095557058] [2020-01-16 18:02:48,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:48,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:48,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559758128] [2020-01-16 18:02:48,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:48,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:48,137 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:02:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:48,295 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:02:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:48,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:48,298 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:02:48,298 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:02:48,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:02:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:02:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:02:48,326 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:02:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:48,327 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:02:48,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:02:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:48,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:48,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:48,329 INFO L426 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 67999667, now seen corresponding path program 24 times [2020-01-16 18:02:48,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:48,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784143850] [2020-01-16 18:02:48,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:48,896 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:02:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:48,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784143850] [2020-01-16 18:02:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:48,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:48,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604378316] [2020-01-16 18:02:48,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:48,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:48,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:48,903 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:02:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:49,073 INFO L93 Difference]: Finished difference Result 1374 states and 4847 transitions. [2020-01-16 18:02:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:49,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:49,077 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:02:49,077 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:02:49,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:02:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 779. [2020-01-16 18:02:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:02:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3128 transitions. [2020-01-16 18:02:49,103 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3128 transitions. Word has length 25 [2020-01-16 18:02:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:49,103 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3128 transitions. [2020-01-16 18:02:49,103 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3128 transitions. [2020-01-16 18:02:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:49,105 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:49,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:49,105 INFO L426 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash -590066189, now seen corresponding path program 25 times [2020-01-16 18:02:49,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:49,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502211589] [2020-01-16 18:02:49,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:49,583 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:49,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502211589] [2020-01-16 18:02:49,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:49,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:49,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80348053] [2020-01-16 18:02:49,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:49,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:49,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:49,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:49,590 INFO L87 Difference]: Start difference. First operand 779 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:02:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:49,760 INFO L93 Difference]: Finished difference Result 1364 states and 4840 transitions. [2020-01-16 18:02:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:49,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:49,764 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:02:49,764 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:02:49,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:02:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 789. [2020-01-16 18:02:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:02:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-01-16 18:02:49,793 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-01-16 18:02:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:49,793 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-01-16 18:02:49,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-01-16 18:02:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:49,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:49,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:49,795 INFO L426 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash 380185425, now seen corresponding path program 26 times [2020-01-16 18:02:49,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:49,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547163667] [2020-01-16 18:02:49,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:50,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547163667] [2020-01-16 18:02:50,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:50,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:50,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360265798] [2020-01-16 18:02:50,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:50,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:50,283 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:02:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:50,457 INFO L93 Difference]: Finished difference Result 1366 states and 4840 transitions. [2020-01-16 18:02:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:50,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:50,461 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:02:50,462 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:02:50,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:02:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-01-16 18:02:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-01-16 18:02:50,491 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-01-16 18:02:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:50,491 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-01-16 18:02:50,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-01-16 18:02:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:50,493 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:50,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:50,493 INFO L426 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1335967889, now seen corresponding path program 27 times [2020-01-16 18:02:50,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:50,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711311307] [2020-01-16 18:02:50,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:51,041 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:51,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711311307] [2020-01-16 18:02:51,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:51,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:51,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651646781] [2020-01-16 18:02:51,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:51,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:51,049 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:02:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:51,265 INFO L93 Difference]: Finished difference Result 1360 states and 4828 transitions. [2020-01-16 18:02:51,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:51,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:51,269 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:02:51,269 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:02:51,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:02:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:02:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-01-16 18:02:51,311 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-01-16 18:02:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:51,311 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-01-16 18:02:51,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-01-16 18:02:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:51,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:51,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:51,313 INFO L426 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1978244689, now seen corresponding path program 28 times [2020-01-16 18:02:51,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:51,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334736185] [2020-01-16 18:02:51,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:51,810 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:02:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:51,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334736185] [2020-01-16 18:02:51,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:51,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:51,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142829189] [2020-01-16 18:02:51,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:51,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:51,818 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:02:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:51,989 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-01-16 18:02:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:51,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:51,993 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:02:51,993 INFO L226 Difference]: Without dead ends: 1344 [2020-01-16 18:02:51,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-01-16 18:02:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-01-16 18:02:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-01-16 18:02:52,024 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-01-16 18:02:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:52,024 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-01-16 18:02:52,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-01-16 18:02:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:52,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:52,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] [2020-01-16 18:02:52,026 INFO L426 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash 718810611, now seen corresponding path program 29 times [2020-01-16 18:02:52,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:52,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771271499] [2020-01-16 18:02:52,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:52,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-01-16 18:02:52,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771271499] [2020-01-16 18:02:52,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:52,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:52,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728052331] [2020-01-16 18:02:52,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:52,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:52,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:52,494 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:02:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:52,649 INFO L93 Difference]: Finished difference Result 1364 states and 4833 transitions. [2020-01-16 18:02:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:52,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:52,653 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:02:52,653 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:02:52,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:02:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-01-16 18:02:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:02:52,684 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:02:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:52,685 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:02:52,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:02:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:52,687 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:52,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] [2020-01-16 18:02:52,687 INFO L426 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1965215727, now seen corresponding path program 30 times [2020-01-16 18:02:52,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:52,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160726342] [2020-01-16 18:02:52,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160726342] [2020-01-16 18:02:53,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:53,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:53,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096481022] [2020-01-16 18:02:53,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:53,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:53,165 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:02:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:53,323 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-01-16 18:02:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:53,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:53,327 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:02:53,327 INFO L226 Difference]: Without dead ends: 1343 [2020-01-16 18:02:53,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-01-16 18:02:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 782. [2020-01-16 18:02:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:02:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-01-16 18:02:53,361 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-01-16 18:02:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:53,361 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-01-16 18:02:53,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-01-16 18:02:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:53,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:53,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:53,364 INFO L426 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1435037641, now seen corresponding path program 31 times [2020-01-16 18:02:53,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:53,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390920439] [2020-01-16 18:02:53,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:53,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390920439] [2020-01-16 18:02:53,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:53,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:53,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608264533] [2020-01-16 18:02:53,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:53,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:53,847 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:02:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:54,008 INFO L93 Difference]: Finished difference Result 1370 states and 4854 transitions. [2020-01-16 18:02:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:54,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:54,013 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:02:54,013 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:02:54,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:02:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 790. [2020-01-16 18:02:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:02:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3161 transitions. [2020-01-16 18:02:54,037 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3161 transitions. Word has length 25 [2020-01-16 18:02:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:54,037 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3161 transitions. [2020-01-16 18:02:54,037 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3161 transitions. [2020-01-16 18:02:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:54,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:54,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:54,039 INFO L426 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -464786027, now seen corresponding path program 32 times [2020-01-16 18:02:54,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:54,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494880921] [2020-01-16 18:02:54,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:54,526 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:02:54,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-01-16 18:02:54,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494880921] [2020-01-16 18:02:54,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:54,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:54,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570019070] [2020-01-16 18:02:54,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:54,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:54,532 INFO L87 Difference]: Start difference. First operand 790 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:02:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:54,692 INFO L93 Difference]: Finished difference Result 1372 states and 4854 transitions. [2020-01-16 18:02:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:54,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:54,695 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:02:54,696 INFO L226 Difference]: Without dead ends: 1353 [2020-01-16 18:02:54,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-01-16 18:02:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 786. [2020-01-16 18:02:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:02:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3150 transitions. [2020-01-16 18:02:54,726 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3150 transitions. Word has length 25 [2020-01-16 18:02:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:54,727 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3150 transitions. [2020-01-16 18:02:54,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3150 transitions. [2020-01-16 18:02:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:54,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:54,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:54,729 INFO L426 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash 48097297, now seen corresponding path program 33 times [2020-01-16 18:02:54,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:54,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944682089] [2020-01-16 18:02:54,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:55,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944682089] [2020-01-16 18:02:55,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:55,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:55,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806543358] [2020-01-16 18:02:55,216 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:55,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:55,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:55,216 INFO L87 Difference]: Start difference. First operand 786 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:02:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:55,361 INFO L93 Difference]: Finished difference Result 1369 states and 4848 transitions. [2020-01-16 18:02:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:55,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:55,363 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:02:55,364 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:02:55,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:02:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 790. [2020-01-16 18:02:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:02:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3157 transitions. [2020-01-16 18:02:55,387 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3157 transitions. Word has length 25 [2020-01-16 18:02:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:55,387 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3157 transitions. [2020-01-16 18:02:55,387 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3157 transitions. [2020-01-16 18:02:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:55,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02: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] [2020-01-16 18:02:55,389 INFO L426 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1049858223, now seen corresponding path program 34 times [2020-01-16 18:02:55,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:55,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558727436] [2020-01-16 18:02:55,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:55,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558727436] [2020-01-16 18:02:55,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:55,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:55,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473043797] [2020-01-16 18:02:55,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:55,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:55,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:55,879 INFO L87 Difference]: Start difference. First operand 790 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:02:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:56,039 INFO L93 Difference]: Finished difference Result 1370 states and 4846 transitions. [2020-01-16 18:02:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:56,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:56,043 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:02:56,043 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:02:56,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:02:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 786. [2020-01-16 18:02:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:02:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-01-16 18:02:56,065 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-01-16 18:02:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:56,066 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-01-16 18:02:56,066 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-01-16 18:02:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:56,067 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:56,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] [2020-01-16 18:02:56,068 INFO L426 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 525031607, now seen corresponding path program 35 times [2020-01-16 18:02:56,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:56,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568627313] [2020-01-16 18:02:56,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:56,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568627313] [2020-01-16 18:02:56,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:56,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:56,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987872369] [2020-01-16 18:02:56,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:56,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:56,565 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:02:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:56,720 INFO L93 Difference]: Finished difference Result 1374 states and 4855 transitions. [2020-01-16 18:02:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:56,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:56,724 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:02:56,724 INFO L226 Difference]: Without dead ends: 1359 [2020-01-16 18:02:56,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-01-16 18:02:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 791. [2020-01-16 18:02:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:02:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:02:56,747 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:02:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:56,747 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:02:56,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:02:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:56,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:56,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:56,749 INFO L426 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1062887185, now seen corresponding path program 36 times [2020-01-16 18:02:56,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:56,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996256963] [2020-01-16 18:02:56,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:57,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996256963] [2020-01-16 18:02:57,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:57,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:57,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533239318] [2020-01-16 18:02:57,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:57,260 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:02:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:57,442 INFO L93 Difference]: Finished difference Result 1373 states and 4848 transitions. [2020-01-16 18:02:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:57,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:57,459 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:02:57,459 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:02:57,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:02:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 782. [2020-01-16 18:02:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:02:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-01-16 18:02:57,481 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-01-16 18:02:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:57,481 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-01-16 18:02:57,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-01-16 18:02:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:57,483 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:57,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:57,483 INFO L426 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 68510711, now seen corresponding path program 37 times [2020-01-16 18:02:57,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:57,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745444321] [2020-01-16 18:02:57,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:57,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745444321] [2020-01-16 18:02:57,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:57,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:57,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153267657] [2020-01-16 18:02:57,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:57,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:57,988 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:02:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:58,181 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-01-16 18:02:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:58,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:58,185 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:02:58,186 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:02:58,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:02:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 788. [2020-01-16 18:02:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:02:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:02:58,209 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:02:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:58,210 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:02:58,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:02:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:58,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:58,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:58,212 INFO L426 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1049265429, now seen corresponding path program 38 times [2020-01-16 18:02:58,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13260081] [2020-01-16 18:02:58,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:58,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13260081] [2020-01-16 18:02:58,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:58,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:58,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67907855] [2020-01-16 18:02:58,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:58,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:58,657 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:02:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:58,821 INFO L93 Difference]: Finished difference Result 1358 states and 4818 transitions. [2020-01-16 18:02:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:58,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:58,825 INFO L225 Difference]: With dead ends: 1358 [2020-01-16 18:02:58,825 INFO L226 Difference]: Without dead ends: 1343 [2020-01-16 18:02:58,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-01-16 18:02:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 785. [2020-01-16 18:02:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:02:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:02:58,848 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:02:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:58,848 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:02:58,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:02:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:58,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:58,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:58,850 INFO L426 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -374388429, now seen corresponding path program 39 times [2020-01-16 18:02:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:58,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968907707] [2020-01-16 18:02:58,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:02:59,306 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-01-16 18:02:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:02:59,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968907707] [2020-01-16 18:02:59,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:02:59,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:02:59,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073176038] [2020-01-16 18:02:59,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:02:59,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:02:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:02:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:02:59,318 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:02:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:02:59,550 INFO L93 Difference]: Finished difference Result 1362 states and 4827 transitions. [2020-01-16 18:02:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:02:59,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:02:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:02:59,556 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:02:59,556 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:02:59,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:02:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:02:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 789. [2020-01-16 18:02:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:02:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:02:59,608 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:02:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:02:59,609 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:02:59,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:02:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:02:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:02:59,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:02:59,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:02:59,613 INFO L426 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:02:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:02:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 627372497, now seen corresponding path program 40 times [2020-01-16 18:02:59,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:02:59,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629542598] [2020-01-16 18:02:59,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:02:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:00,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629542598] [2020-01-16 18:03:00,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:00,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:00,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602397949] [2020-01-16 18:03:00,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:00,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:00,080 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:03:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:00,238 INFO L93 Difference]: Finished difference Result 1363 states and 4825 transitions. [2020-01-16 18:03:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:00,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:00,242 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:03:00,242 INFO L226 Difference]: Without dead ends: 1345 [2020-01-16 18:03:00,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-01-16 18:03:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 785. [2020-01-16 18:03:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:03:00,265 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:00,265 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:03:00,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:03:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:00,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:00,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:00,267 INFO L426 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2039083063, now seen corresponding path program 41 times [2020-01-16 18:03:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370666291] [2020-01-16 18:03:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:00,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370666291] [2020-01-16 18:03:00,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:00,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:00,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674328393] [2020-01-16 18:03:00,731 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:00,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:00,732 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:00,895 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-01-16 18:03:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:00,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:00,899 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:03:00,899 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:03:00,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:03:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:03:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:03:00,923 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:03:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:00,923 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:03:00,923 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:03:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:00,924 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:00,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:00,925 INFO L426 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 965997683, now seen corresponding path program 42 times [2020-01-16 18:03:00,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:00,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075973931] [2020-01-16 18:03:00,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:01,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-01-16 18:03:01,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075973931] [2020-01-16 18:03:01,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:01,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:01,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019257592] [2020-01-16 18:03:01,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:01,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:01,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:01,405 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:03:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:01,574 INFO L93 Difference]: Finished difference Result 1361 states and 4818 transitions. [2020-01-16 18:03:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:01,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:01,578 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:03:01,578 INFO L226 Difference]: Without dead ends: 1341 [2020-01-16 18:03:01,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-01-16 18:03:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 782. [2020-01-16 18:03:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:03:01,604 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:03:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:01,604 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:03:01,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:03:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:01,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:01,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:01,607 INFO L426 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1338386193, now seen corresponding path program 43 times [2020-01-16 18:03:01,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:01,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118659811] [2020-01-16 18:03:01,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:02,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118659811] [2020-01-16 18:03:02,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:02,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:02,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516935919] [2020-01-16 18:03:02,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:02,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:02,070 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:03:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:02,240 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-01-16 18:03:02,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:02,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:02,243 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:03:02,243 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:03:02,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:03:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-01-16 18:03:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:03:02,275 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:03:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:02,277 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:03:02,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:03:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:02,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:02,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:02,279 INFO L426 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1345640145, now seen corresponding path program 44 times [2020-01-16 18:03:02,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:02,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953401258] [2020-01-16 18:03:02,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:02,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953401258] [2020-01-16 18:03:02,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:02,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:02,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940387608] [2020-01-16 18:03:02,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:02,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:02,754 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:03:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:02,949 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-01-16 18:03:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:02,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:02,953 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:03:02,953 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:03:02,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:03:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-01-16 18:03:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:03:02,976 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:02,976 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:03:02,976 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:03:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:02,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:02,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:02,978 INFO L426 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:02,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1862489515, now seen corresponding path program 45 times [2020-01-16 18:03:02,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:02,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72119475] [2020-01-16 18:03:02,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:03,475 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:03:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:03,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72119475] [2020-01-16 18:03:03,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:03,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:03,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368628147] [2020-01-16 18:03:03,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:03,482 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:03,705 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:03:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:03,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:03,709 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:03:03,710 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:03:03,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:03:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 790. [2020-01-16 18:03:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:03:03,733 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:03:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:03,733 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:03:03,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:03:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:03,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:03,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:03,734 INFO L426 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1324633937, now seen corresponding path program 46 times [2020-01-16 18:03:03,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:03,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562050882] [2020-01-16 18:03:03,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:04,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562050882] [2020-01-16 18:03:04,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:04,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:04,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214066115] [2020-01-16 18:03:04,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:04,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:04,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:04,215 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:03:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:04,425 INFO L93 Difference]: Finished difference Result 1369 states and 4835 transitions. [2020-01-16 18:03:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:04,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:04,429 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:03:04,430 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:03:04,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:03:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:03:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:03:04,452 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:03:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:04,453 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:03:04,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:03:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:04,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:04,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] [2020-01-16 18:03:04,454 INFO L426 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1851986411, now seen corresponding path program 47 times [2020-01-16 18:03:04,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:04,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879464981] [2020-01-16 18:03:04,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:04,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-01-16 18:03:04,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879464981] [2020-01-16 18:03:04,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:04,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:04,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947767249] [2020-01-16 18:03:04,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:04,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:04,941 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:03:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:05,108 INFO L93 Difference]: Finished difference Result 1362 states and 4821 transitions. [2020-01-16 18:03:05,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:05,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:05,112 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:03:05,112 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:03:05,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:03:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-01-16 18:03:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:03:05,137 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:03:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:05,137 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:03:05,137 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:03:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:05,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:05,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:05,139 INFO L426 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1369895505, now seen corresponding path program 48 times [2020-01-16 18:03:05,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:05,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918154666] [2020-01-16 18:03:05,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:05,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918154666] [2020-01-16 18:03:05,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:05,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:05,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564349033] [2020-01-16 18:03:05,635 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:05,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:05,635 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:03:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:05,848 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-01-16 18:03:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:05,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:05,852 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:03:05,852 INFO L226 Difference]: Without dead ends: 1341 [2020-01-16 18:03:05,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-01-16 18:03:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 779. [2020-01-16 18:03:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:03:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3125 transitions. [2020-01-16 18:03:05,875 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3125 transitions. Word has length 25 [2020-01-16 18:03:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:05,875 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3125 transitions. [2020-01-16 18:03:05,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3125 transitions. [2020-01-16 18:03:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:05,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:05,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:05,876 INFO L426 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1224707533, now seen corresponding path program 49 times [2020-01-16 18:03:05,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:05,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495594372] [2020-01-16 18:03:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:06,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-01-16 18:03:06,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495594372] [2020-01-16 18:03:06,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:06,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:06,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322469710] [2020-01-16 18:03:06,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:06,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:06,334 INFO L87 Difference]: Start difference. First operand 779 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:03:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:06,487 INFO L93 Difference]: Finished difference Result 1388 states and 4908 transitions. [2020-01-16 18:03:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:06,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:06,491 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:03:06,491 INFO L226 Difference]: Without dead ends: 1375 [2020-01-16 18:03:06,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-01-16 18:03:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 791. [2020-01-16 18:03:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-01-16 18:03:06,527 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-01-16 18:03:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:06,527 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-01-16 18:03:06,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-01-16 18:03:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:06,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:06,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:06,529 INFO L426 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash -254455919, now seen corresponding path program 50 times [2020-01-16 18:03:06,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:06,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492774988] [2020-01-16 18:03:06,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:07,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492774988] [2020-01-16 18:03:07,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:07,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:07,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81347488] [2020-01-16 18:03:07,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:07,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:07,009 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:03:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:07,172 INFO L93 Difference]: Finished difference Result 1390 states and 4908 transitions. [2020-01-16 18:03:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:07,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:07,176 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:03:07,176 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:03:07,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:03:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-01-16 18:03:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3155 transitions. [2020-01-16 18:03:07,200 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3155 transitions. Word has length 25 [2020-01-16 18:03:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:07,200 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3155 transitions. [2020-01-16 18:03:07,201 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3155 transitions. [2020-01-16 18:03:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:07,202 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:07,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:07,203 INFO L426 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1667606673, now seen corresponding path program 51 times [2020-01-16 18:03:07,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:07,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102786960] [2020-01-16 18:03:07,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:07,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102786960] [2020-01-16 18:03:07,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:07,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:07,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273970572] [2020-01-16 18:03:07,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:07,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:07,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:07,667 INFO L87 Difference]: Start difference. First operand 787 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:03:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:07,829 INFO L93 Difference]: Finished difference Result 1389 states and 4906 transitions. [2020-01-16 18:03:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:07,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:07,834 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:03:07,834 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:03:07,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:03:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-01-16 18:03:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-01-16 18:03:07,858 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:07,858 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-01-16 18:03:07,858 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-01-16 18:03:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:07,860 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:07,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:07,860 INFO L426 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -676348851, now seen corresponding path program 52 times [2020-01-16 18:03:07,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:07,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492991308] [2020-01-16 18:03:07,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:08,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492991308] [2020-01-16 18:03:08,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:08,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:08,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572966789] [2020-01-16 18:03:08,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:08,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:08,335 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:03:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:08,577 INFO L93 Difference]: Finished difference Result 1392 states and 4908 transitions. [2020-01-16 18:03:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:08,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:08,581 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:03:08,581 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:03:08,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:03:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-01-16 18:03:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-01-16 18:03:08,628 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-01-16 18:03:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:08,629 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-01-16 18:03:08,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-01-16 18:03:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:08,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:08,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:08,631 INFO L426 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 409765491, now seen corresponding path program 53 times [2020-01-16 18:03:08,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:08,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132439165] [2020-01-16 18:03:08,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:09,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132439165] [2020-01-16 18:03:09,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:09,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:09,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890283606] [2020-01-16 18:03:09,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:09,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:09,115 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:03:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:09,286 INFO L93 Difference]: Finished difference Result 1395 states and 4916 transitions. [2020-01-16 18:03:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:09,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:09,291 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:03:09,291 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:03:09,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:03:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 793. [2020-01-16 18:03:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:03:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3162 transitions. [2020-01-16 18:03:09,313 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:09,314 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3162 transitions. [2020-01-16 18:03:09,314 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3162 transitions. [2020-01-16 18:03:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:09,315 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:09,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:09,315 INFO L426 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash -663319889, now seen corresponding path program 54 times [2020-01-16 18:03:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:09,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782187480] [2020-01-16 18:03:09,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:09,813 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:03:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:09,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782187480] [2020-01-16 18:03:09,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:09,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:09,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141107465] [2020-01-16 18:03:09,819 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:09,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:09,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:09,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:09,820 INFO L87 Difference]: Start difference. First operand 793 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:03:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:09,986 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-01-16 18:03:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:09,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:09,990 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:03:09,990 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:03:09,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:03:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 783. [2020-01-16 18:03:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:03:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3140 transitions. [2020-01-16 18:03:10,015 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3140 transitions. Word has length 25 [2020-01-16 18:03:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:10,016 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3140 transitions. [2020-01-16 18:03:10,016 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3140 transitions. [2020-01-16 18:03:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:10,017 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:10,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:10,017 INFO L426 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1647193259, now seen corresponding path program 55 times [2020-01-16 18:03:10,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:10,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462501078] [2020-01-16 18:03:10,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:10,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462501078] [2020-01-16 18:03:10,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:10,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:10,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921238777] [2020-01-16 18:03:10,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:10,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:10,498 INFO L87 Difference]: Start difference. First operand 783 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:03:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:10,688 INFO L93 Difference]: Finished difference Result 1385 states and 4897 transitions. [2020-01-16 18:03:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:10,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:10,693 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:03:10,693 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:03:10,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:03:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:03:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-01-16 18:03:10,715 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:10,715 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-01-16 18:03:10,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-01-16 18:03:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:10,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:10,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:10,716 INFO L426 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash -676941645, now seen corresponding path program 56 times [2020-01-16 18:03:10,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:10,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331903769] [2020-01-16 18:03:10,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:11,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-01-16 18:03:11,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331903769] [2020-01-16 18:03:11,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:11,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:11,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853896268] [2020-01-16 18:03:11,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:11,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:11,206 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:03:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:11,370 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-01-16 18:03:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:11,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:11,374 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:03:11,374 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:03:11,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:03:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:03:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-01-16 18:03:11,397 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-01-16 18:03:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:11,397 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-01-16 18:03:11,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-01-16 18:03:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:11,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:11,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:11,398 INFO L426 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash -164058321, now seen corresponding path program 57 times [2020-01-16 18:03:11,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:11,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508724573] [2020-01-16 18:03:11,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:11,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508724573] [2020-01-16 18:03:11,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:11,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:11,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283119328] [2020-01-16 18:03:11,873 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:11,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:11,874 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:03:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:12,064 INFO L93 Difference]: Finished difference Result 1384 states and 4891 transitions. [2020-01-16 18:03:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:12,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:12,068 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:03:12,068 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:03:12,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:03:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 791. [2020-01-16 18:03:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:03:12,091 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:03:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:12,091 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:03:12,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:03:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:12,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:12,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:12,093 INFO L426 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash 837702605, now seen corresponding path program 58 times [2020-01-16 18:03:12,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:12,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084812517] [2020-01-16 18:03:12,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:12,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084812517] [2020-01-16 18:03:12,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:12,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:12,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824968693] [2020-01-16 18:03:12,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:12,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:12,631 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:03:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:12,796 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-01-16 18:03:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:12,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:12,800 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:03:12,800 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:03:12,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:03:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 787. [2020-01-16 18:03:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:03:12,823 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:03:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:12,823 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:03:12,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:03:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:12,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:12,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:12,825 INFO L426 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash 312875989, now seen corresponding path program 59 times [2020-01-16 18:03:12,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:12,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683711697] [2020-01-16 18:03:12,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:13,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683711697] [2020-01-16 18:03:13,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:13,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:13,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215237238] [2020-01-16 18:03:13,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:13,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:13,318 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:03:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:13,519 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:03:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:13,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:13,523 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:03:13,523 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:03:13,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:03:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-01-16 18:03:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:03:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3156 transitions. [2020-01-16 18:03:13,547 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3156 transitions. Word has length 25 [2020-01-16 18:03:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:13,547 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3156 transitions. [2020-01-16 18:03:13,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3156 transitions. [2020-01-16 18:03:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:13,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:13,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:13,548 INFO L426 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash 850731567, now seen corresponding path program 60 times [2020-01-16 18:03:13,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:13,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348503206] [2020-01-16 18:03:13,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:14,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-01-16 18:03:14,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348503206] [2020-01-16 18:03:14,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:14,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:14,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722085510] [2020-01-16 18:03:14,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:14,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:14,005 INFO L87 Difference]: Start difference. First operand 792 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:03:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:14,174 INFO L93 Difference]: Finished difference Result 1388 states and 4891 transitions. [2020-01-16 18:03:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:14,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:14,178 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:03:14,178 INFO L226 Difference]: Without dead ends: 1365 [2020-01-16 18:03:14,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-01-16 18:03:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 783. [2020-01-16 18:03:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:03:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3136 transitions. [2020-01-16 18:03:14,200 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3136 transitions. Word has length 25 [2020-01-16 18:03:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:14,200 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3136 transitions. [2020-01-16 18:03:14,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3136 transitions. [2020-01-16 18:03:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:14,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:14,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:14,202 INFO L426 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1359903445, now seen corresponding path program 61 times [2020-01-16 18:03:14,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:14,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63260096] [2020-01-16 18:03:14,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:14,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63260096] [2020-01-16 18:03:14,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:14,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:14,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649607542] [2020-01-16 18:03:14,681 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:14,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:14,681 INFO L87 Difference]: Start difference. First operand 783 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:03:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:14,882 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-01-16 18:03:14,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:14,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:14,887 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:03:14,887 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:03:14,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:03:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-01-16 18:03:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:03:14,911 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:03:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:14,911 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:03:14,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:03:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:14,913 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:14,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:14,913 INFO L426 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1943806029, now seen corresponding path program 62 times [2020-01-16 18:03:14,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:14,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553103720] [2020-01-16 18:03:14,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:15,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-01-16 18:03:15,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553103720] [2020-01-16 18:03:15,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:15,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:15,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804081193] [2020-01-16 18:03:15,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:15,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:15,376 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:03:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:15,552 INFO L93 Difference]: Finished difference Result 1390 states and 4899 transitions. [2020-01-16 18:03:15,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:15,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:15,556 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:03:15,556 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:03:15,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:03:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:03:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:03:15,578 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:03:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:15,578 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:03:15,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:03:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:15,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:15,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:15,580 INFO L426 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1009029773, now seen corresponding path program 63 times [2020-01-16 18:03:15,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:15,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369410741] [2020-01-16 18:03:15,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:16,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369410741] [2020-01-16 18:03:16,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:16,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043971759] [2020-01-16 18:03:16,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:16,054 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:03:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:16,239 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-01-16 18:03:16,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:16,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:16,244 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:03:16,244 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:03:16,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:03:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:03:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-01-16 18:03:16,267 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-01-16 18:03:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:16,267 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-01-16 18:03:16,267 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-01-16 18:03:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:16,268 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:16,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] [2020-01-16 18:03:16,268 INFO L426 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash -7268847, now seen corresponding path program 64 times [2020-01-16 18:03:16,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:16,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276488418] [2020-01-16 18:03:16,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:16,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-01-16 18:03:16,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276488418] [2020-01-16 18:03:16,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:16,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548694028] [2020-01-16 18:03:16,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:16,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:16,738 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:03:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:16,893 INFO L93 Difference]: Finished difference Result 1386 states and 4887 transitions. [2020-01-16 18:03:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:16,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:16,897 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:03:16,897 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:03:16,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:03:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:03:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3143 transitions. [2020-01-16 18:03:16,920 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3143 transitions. Word has length 25 [2020-01-16 18:03:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:16,920 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3143 transitions. [2020-01-16 18:03:16,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3143 transitions. [2020-01-16 18:03:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:16,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:16,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:16,921 INFO L426 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash -953988395, now seen corresponding path program 65 times [2020-01-16 18:03:16,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:16,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693235048] [2020-01-16 18:03:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693235048] [2020-01-16 18:03:17,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:17,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:17,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417755926] [2020-01-16 18:03:17,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:17,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:17,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:17,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:17,379 INFO L87 Difference]: Start difference. First operand 787 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:03:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:17,554 INFO L93 Difference]: Finished difference Result 1392 states and 4900 transitions. [2020-01-16 18:03:17,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:17,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:17,558 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:03:17,558 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:03:17,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:03:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-01-16 18:03:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:03:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3152 transitions. [2020-01-16 18:03:17,580 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3152 transitions. Word has length 25 [2020-01-16 18:03:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:17,580 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3152 transitions. [2020-01-16 18:03:17,580 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3152 transitions. [2020-01-16 18:03:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:17,581 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:17,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:17,581 INFO L426 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 656952563, now seen corresponding path program 66 times [2020-01-16 18:03:17,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:17,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648190362] [2020-01-16 18:03:17,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:18,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-01-16 18:03:18,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648190362] [2020-01-16 18:03:18,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:18,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:18,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757697768] [2020-01-16 18:03:18,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:18,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:18,057 INFO L87 Difference]: Start difference. First operand 792 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:03:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:18,242 INFO L93 Difference]: Finished difference Result 1390 states and 4891 transitions. [2020-01-16 18:03:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:18,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:18,246 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:03:18,246 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:03:18,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:03:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-01-16 18:03:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:03:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-01-16 18:03:18,269 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-01-16 18:03:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:18,269 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-01-16 18:03:18,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-01-16 18:03:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:18,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:18,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:18,271 INFO L426 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1029341073, now seen corresponding path program 67 times [2020-01-16 18:03:18,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:18,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317785458] [2020-01-16 18:03:18,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:18,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317785458] [2020-01-16 18:03:18,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:18,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:18,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161657326] [2020-01-16 18:03:18,725 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:18,726 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:03:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:18,878 INFO L93 Difference]: Finished difference Result 1399 states and 4924 transitions. [2020-01-16 18:03:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:18,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:18,881 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:03:18,882 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:03:18,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:03:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 794. [2020-01-16 18:03:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:03:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:03:18,905 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:18,905 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:03:18,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:03:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:18,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:18,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] [2020-01-16 18:03:18,906 INFO L426 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -43744307, now seen corresponding path program 68 times [2020-01-16 18:03:18,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:18,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522487278] [2020-01-16 18:03:18,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:19,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-01-16 18:03:19,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522487278] [2020-01-16 18:03:19,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:19,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:19,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267589751] [2020-01-16 18:03:19,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:19,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:19,405 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:03:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:19,560 INFO L93 Difference]: Finished difference Result 1400 states and 4920 transitions. [2020-01-16 18:03:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:19,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:19,564 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:03:19,564 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:03:19,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:03:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 788. [2020-01-16 18:03:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:03:19,587 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:03:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:19,587 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:03:19,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:03:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:19,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:19,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] [2020-01-16 18:03:19,588 INFO L426 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -571096781, now seen corresponding path program 69 times [2020-01-16 18:03:19,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:19,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129883812] [2020-01-16 18:03:19,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:20,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129883812] [2020-01-16 18:03:20,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:20,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:20,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566355515] [2020-01-16 18:03:20,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:20,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:20,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:20,064 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:03:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:20,209 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-01-16 18:03:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:20,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:20,213 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:03:20,214 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:03:20,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:03:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 793. [2020-01-16 18:03:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:03:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-01-16 18:03:20,236 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-01-16 18:03:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:20,237 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-01-16 18:03:20,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-01-16 18:03:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:20,238 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:20,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:20,238 INFO L426 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash -33241203, now seen corresponding path program 70 times [2020-01-16 18:03:20,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:20,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535396824] [2020-01-16 18:03:20,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:20,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535396824] [2020-01-16 18:03:20,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:20,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:20,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528309881] [2020-01-16 18:03:20,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:20,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:20,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:20,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:20,718 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:03:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:20,881 INFO L93 Difference]: Finished difference Result 1395 states and 4905 transitions. [2020-01-16 18:03:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:20,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:20,885 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:03:20,885 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:03:20,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:03:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 788. [2020-01-16 18:03:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3141 transitions. [2020-01-16 18:03:20,908 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:20,908 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3141 transitions. [2020-01-16 18:03:20,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3141 transitions. [2020-01-16 18:03:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:20,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:20,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] [2020-01-16 18:03:20,909 INFO L426 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash -550090573, now seen corresponding path program 71 times [2020-01-16 18:03:20,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:20,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226765143] [2020-01-16 18:03:20,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226765143] [2020-01-16 18:03:21,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:21,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552413480] [2020-01-16 18:03:21,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:21,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:21,373 INFO L87 Difference]: Start difference. First operand 788 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:21,550 INFO L93 Difference]: Finished difference Result 1398 states and 4911 transitions. [2020-01-16 18:03:21,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:21,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:21,554 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:03:21,554 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:03:21,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:03:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 793. [2020-01-16 18:03:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:03:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3150 transitions. [2020-01-16 18:03:21,579 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3150 transitions. Word has length 25 [2020-01-16 18:03:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:21,579 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3150 transitions. [2020-01-16 18:03:21,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3150 transitions. [2020-01-16 18:03:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:21,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:21,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:21,580 INFO L426 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1060850385, now seen corresponding path program 72 times [2020-01-16 18:03:21,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:21,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996723755] [2020-01-16 18:03:21,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:22,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-01-16 18:03:22,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996723755] [2020-01-16 18:03:22,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:22,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:22,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592486034] [2020-01-16 18:03:22,052 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:22,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:22,052 INFO L87 Difference]: Start difference. First operand 793 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:03:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:22,210 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-01-16 18:03:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:22,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:22,214 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:03:22,215 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:03:22,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:03:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 779. [2020-01-16 18:03:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:03:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3122 transitions. [2020-01-16 18:03:22,238 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3122 transitions. Word has length 25 [2020-01-16 18:03:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:22,238 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3122 transitions. [2020-01-16 18:03:22,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3122 transitions. [2020-01-16 18:03:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:22,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:22,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:22,239 INFO L426 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 66685201, now seen corresponding path program 73 times [2020-01-16 18:03:22,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:22,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965612870] [2020-01-16 18:03:22,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:22,720 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:03:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:22,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965612870] [2020-01-16 18:03:22,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:22,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:22,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30117606] [2020-01-16 18:03:22,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:22,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:22,728 INFO L87 Difference]: Start difference. First operand 779 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:03:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:22,885 INFO L93 Difference]: Finished difference Result 1362 states and 4829 transitions. [2020-01-16 18:03:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:22,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:22,888 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:03:22,888 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:03:22,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:03:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-01-16 18:03:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-01-16 18:03:22,911 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-01-16 18:03:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:22,911 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-01-16 18:03:22,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-01-16 18:03:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:22,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:22,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:22,913 INFO L426 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1047439919, now seen corresponding path program 74 times [2020-01-16 18:03:22,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:22,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139786642] [2020-01-16 18:03:22,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:23,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139786642] [2020-01-16 18:03:23,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:23,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:23,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17880208] [2020-01-16 18:03:23,377 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:23,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:23,378 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:03:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:23,553 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-01-16 18:03:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:23,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:23,558 INFO L225 Difference]: With dead ends: 1361 [2020-01-16 18:03:23,558 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:03:23,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:03:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-01-16 18:03:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-01-16 18:03:23,581 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-01-16 18:03:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:23,581 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-01-16 18:03:23,581 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-01-16 18:03:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:23,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:23,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:23,583 INFO L426 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1992719279, now seen corresponding path program 75 times [2020-01-16 18:03:23,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:23,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156750698] [2020-01-16 18:03:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:24,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156750698] [2020-01-16 18:03:24,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:24,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:24,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245493466] [2020-01-16 18:03:24,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:24,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:24,051 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:03:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:24,204 INFO L93 Difference]: Finished difference Result 1367 states and 4837 transitions. [2020-01-16 18:03:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:24,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:24,208 INFO L225 Difference]: With dead ends: 1367 [2020-01-16 18:03:24,209 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:03:24,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:03:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-01-16 18:03:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:03:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:03:24,231 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:03:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:24,231 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:03:24,231 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:03:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:24,232 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:24,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:24,232 INFO L426 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1310990195, now seen corresponding path program 76 times [2020-01-16 18:03:24,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:24,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348281171] [2020-01-16 18:03:24,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:24,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348281171] [2020-01-16 18:03:24,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:24,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:24,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872672776] [2020-01-16 18:03:24,693 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:24,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:24,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:24,694 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:03:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:24,872 INFO L93 Difference]: Finished difference Result 1370 states and 4839 transitions. [2020-01-16 18:03:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:24,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:24,875 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:03:24,876 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:03:24,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:03:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-01-16 18:03:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:03:24,897 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:24,898 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:03:24,898 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:03:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:24,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:24,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:24,899 INFO L426 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1711661329, now seen corresponding path program 77 times [2020-01-16 18:03:24,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:24,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026813538] [2020-01-16 18:03:24,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:25,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-01-16 18:03:25,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026813538] [2020-01-16 18:03:25,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:25,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:25,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408900886] [2020-01-16 18:03:25,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:25,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:25,376 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:25,524 INFO L93 Difference]: Finished difference Result 1364 states and 4827 transitions. [2020-01-16 18:03:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:25,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:25,528 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:03:25,529 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:03:25,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:03:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:03:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:03:25,551 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:03:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:25,551 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:03:25,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:03:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:25,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:25,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] [2020-01-16 18:03:25,553 INFO L426 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -972365009, now seen corresponding path program 78 times [2020-01-16 18:03:25,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:25,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498032003] [2020-01-16 18:03:25,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:26,021 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:03:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:26,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498032003] [2020-01-16 18:03:26,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:26,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:26,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174378374] [2020-01-16 18:03:26,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:26,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:26,028 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:03:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:26,200 INFO L93 Difference]: Finished difference Result 1368 states and 4832 transitions. [2020-01-16 18:03:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:26,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:26,204 INFO L225 Difference]: With dead ends: 1368 [2020-01-16 18:03:26,204 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:03:26,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:03:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-01-16 18:03:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:03:26,227 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:03:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:26,227 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:03:26,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:03:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:26,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:26,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:26,229 INFO L426 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -355800525, now seen corresponding path program 79 times [2020-01-16 18:03:26,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:26,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569826675] [2020-01-16 18:03:26,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:26,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569826675] [2020-01-16 18:03:26,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:26,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:26,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539609021] [2020-01-16 18:03:26,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:26,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:26,690 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:03:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:26,861 INFO L93 Difference]: Finished difference Result 1360 states and 4822 transitions. [2020-01-16 18:03:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:26,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:26,865 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:03:26,865 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:03:26,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:03:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-01-16 18:03:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:03:26,888 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:03:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:26,889 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:03:26,889 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:03:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:26,890 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:26,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:26,891 INFO L426 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash 624954193, now seen corresponding path program 80 times [2020-01-16 18:03:26,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:26,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164465234] [2020-01-16 18:03:26,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:27,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164465234] [2020-01-16 18:03:27,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:27,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:27,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158907346] [2020-01-16 18:03:27,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:27,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:27,346 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:03:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:27,545 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-01-16 18:03:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:27,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:27,551 INFO L225 Difference]: With dead ends: 1359 [2020-01-16 18:03:27,551 INFO L226 Difference]: Without dead ends: 1344 [2020-01-16 18:03:27,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-01-16 18:03:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-01-16 18:03:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:03:27,598 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:27,598 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:03:27,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:03:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:27,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:27,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] [2020-01-16 18:03:27,602 INFO L426 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash -798699665, now seen corresponding path program 81 times [2020-01-16 18:03:27,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:27,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540162796] [2020-01-16 18:03:27,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:28,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-01-16 18:03:28,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540162796] [2020-01-16 18:03:28,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:28,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:28,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050549351] [2020-01-16 18:03:28,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:28,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:28,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:28,090 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:28,255 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-01-16 18:03:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:28,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:28,259 INFO L225 Difference]: With dead ends: 1363 [2020-01-16 18:03:28,259 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:03:28,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:03:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 789. [2020-01-16 18:03:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:03:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:03:28,281 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:03:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:28,282 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:03:28,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:03:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:28,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:28,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:28,283 INFO L426 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 203061261, now seen corresponding path program 82 times [2020-01-16 18:03:28,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:28,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589805853] [2020-01-16 18:03:28,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:28,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589805853] [2020-01-16 18:03:28,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:28,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:28,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595790323] [2020-01-16 18:03:28,758 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:28,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:28,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:28,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:28,759 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:03:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:28,907 INFO L93 Difference]: Finished difference Result 1364 states and 4824 transitions. [2020-01-16 18:03:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:28,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:28,912 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:03:28,912 INFO L226 Difference]: Without dead ends: 1346 [2020-01-16 18:03:28,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-01-16 18:03:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-01-16 18:03:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:03:28,934 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:03:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:28,934 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:03:28,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:03:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:28,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:28,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:28,936 INFO L426 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1614771827, now seen corresponding path program 83 times [2020-01-16 18:03:28,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:28,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087359100] [2020-01-16 18:03:28,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:29,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087359100] [2020-01-16 18:03:29,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:29,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:29,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559718151] [2020-01-16 18:03:29,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:29,391 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:03:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:29,573 INFO L93 Difference]: Finished difference Result 1360 states and 4816 transitions. [2020-01-16 18:03:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:29,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:29,577 INFO L225 Difference]: With dead ends: 1360 [2020-01-16 18:03:29,578 INFO L226 Difference]: Without dead ends: 1348 [2020-01-16 18:03:29,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-01-16 18:03:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 788. [2020-01-16 18:03:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:03:29,600 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:03:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:29,600 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:03:29,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:03:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:29,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:29,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] [2020-01-16 18:03:29,602 INFO L426 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:29,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash 541686447, now seen corresponding path program 84 times [2020-01-16 18:03:29,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:29,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169714200] [2020-01-16 18:03:29,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:30,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169714200] [2020-01-16 18:03:30,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:30,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:30,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918066114] [2020-01-16 18:03:30,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:30,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:30,039 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:03:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:30,214 INFO L93 Difference]: Finished difference Result 1362 states and 4817 transitions. [2020-01-16 18:03:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:30,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:30,218 INFO L225 Difference]: With dead ends: 1362 [2020-01-16 18:03:30,218 INFO L226 Difference]: Without dead ends: 1342 [2020-01-16 18:03:30,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-01-16 18:03:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 782. [2020-01-16 18:03:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-01-16 18:03:30,241 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-01-16 18:03:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:30,241 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-01-16 18:03:30,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-01-16 18:03:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:30,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:30,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:30,242 INFO L426 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1147747827, now seen corresponding path program 85 times [2020-01-16 18:03:30,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:30,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565756420] [2020-01-16 18:03:30,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:30,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565756420] [2020-01-16 18:03:30,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:30,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:30,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588010738] [2020-01-16 18:03:30,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:30,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:30,689 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:03:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:30,836 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-01-16 18:03:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:30,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:30,840 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:03:30,840 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:03:30,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:03:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 790. [2020-01-16 18:03:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-01-16 18:03:30,862 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-01-16 18:03:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:30,862 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-01-16 18:03:30,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-01-16 18:03:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:30,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:30,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:30,864 INFO L426 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2139005649, now seen corresponding path program 86 times [2020-01-16 18:03:30,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:30,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831952517] [2020-01-16 18:03:30,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:31,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831952517] [2020-01-16 18:03:31,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:31,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:31,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140475433] [2020-01-16 18:03:31,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:31,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:31,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:31,308 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:03:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:31,476 INFO L93 Difference]: Finished difference Result 1376 states and 4853 transitions. [2020-01-16 18:03:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:31,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:31,480 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:03:31,480 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:03:31,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:03:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 786. [2020-01-16 18:03:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:03:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3141 transitions. [2020-01-16 18:03:31,502 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:31,502 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3141 transitions. [2020-01-16 18:03:31,502 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3141 transitions. [2020-01-16 18:03:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:31,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:31,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] [2020-01-16 18:03:31,503 INFO L426 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1221185391, now seen corresponding path program 87 times [2020-01-16 18:03:31,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:31,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617110377] [2020-01-16 18:03:31,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:31,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617110377] [2020-01-16 18:03:31,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:31,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:31,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614870371] [2020-01-16 18:03:31,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:31,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:31,954 INFO L87 Difference]: Start difference. First operand 786 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:32,124 INFO L93 Difference]: Finished difference Result 1371 states and 4843 transitions. [2020-01-16 18:03:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:32,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:32,128 INFO L225 Difference]: With dead ends: 1371 [2020-01-16 18:03:32,129 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:03:32,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:03:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-01-16 18:03:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:03:32,151 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:03:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:32,151 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:03:32,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:03:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:32,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:32,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:32,152 INFO L426 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash -219424465, now seen corresponding path program 88 times [2020-01-16 18:03:32,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:32,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519267492] [2020-01-16 18:03:32,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:32,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519267492] [2020-01-16 18:03:32,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:32,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:32,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93416721] [2020-01-16 18:03:32,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:32,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:32,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:32,607 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:03:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:32,796 INFO L93 Difference]: Finished difference Result 1372 states and 4841 transitions. [2020-01-16 18:03:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:32,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:32,801 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:03:32,801 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:03:32,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:03:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 786. [2020-01-16 18:03:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:03:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-01-16 18:03:32,823 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-01-16 18:03:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:32,823 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-01-16 18:03:32,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-01-16 18:03:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:32,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:32,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:32,824 INFO L426 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:32,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1166144013, now seen corresponding path program 89 times [2020-01-16 18:03:32,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:32,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786236859] [2020-01-16 18:03:32,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:33,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786236859] [2020-01-16 18:03:33,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:33,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:33,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581970611] [2020-01-16 18:03:33,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:33,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:33,278 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:03:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:33,453 INFO L93 Difference]: Finished difference Result 1378 states and 4854 transitions. [2020-01-16 18:03:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:33,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:33,457 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:03:33,457 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:03:33,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:03:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 791. [2020-01-16 18:03:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:03:33,479 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:03:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:33,480 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:03:33,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:03:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:33,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:33,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:33,481 INFO L426 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash 444796945, now seen corresponding path program 90 times [2020-01-16 18:03:33,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140238252] [2020-01-16 18:03:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:33,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-01-16 18:03:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140238252] [2020-01-16 18:03:33,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:33,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:33,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286413029] [2020-01-16 18:03:33,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:33,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:33,935 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:03:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:34,093 INFO L93 Difference]: Finished difference Result 1376 states and 4845 transitions. [2020-01-16 18:03:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:34,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:34,097 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:03:34,097 INFO L226 Difference]: Without dead ends: 1353 [2020-01-16 18:03:34,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-01-16 18:03:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 782. [2020-01-16 18:03:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:03:34,119 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:03:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:34,120 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:03:34,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:03:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:34,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:34,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:34,121 INFO L426 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1963730385, now seen corresponding path program 91 times [2020-01-16 18:03:34,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:34,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417128019] [2020-01-16 18:03:34,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:34,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417128019] [2020-01-16 18:03:34,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:34,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:34,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763778695] [2020-01-16 18:03:34,556 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:34,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:34,556 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:03:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:34,736 INFO L93 Difference]: Finished difference Result 1366 states and 4829 transitions. [2020-01-16 18:03:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:34,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:34,740 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:03:34,740 INFO L226 Difference]: Without dead ends: 1354 [2020-01-16 18:03:34,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-01-16 18:03:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-01-16 18:03:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:03:34,765 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:03:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:34,765 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:03:34,765 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:03:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:34,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:34,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:34,766 INFO L426 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -352789427, now seen corresponding path program 92 times [2020-01-16 18:03:34,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:34,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573890601] [2020-01-16 18:03:34,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:35,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573890601] [2020-01-16 18:03:35,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:35,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:35,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404107618] [2020-01-16 18:03:35,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:35,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:35,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:35,186 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:03:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:35,346 INFO L93 Difference]: Finished difference Result 1370 states and 4834 transitions. [2020-01-16 18:03:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:35,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:35,350 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:03:35,350 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:03:35,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:03:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 785. [2020-01-16 18:03:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:03:35,373 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:03:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:35,373 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:03:35,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:03:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:35,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:35,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] [2020-01-16 18:03:35,374 INFO L426 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 730799057, now seen corresponding path program 93 times [2020-01-16 18:03:35,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:35,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775222656] [2020-01-16 18:03:35,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:35,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775222656] [2020-01-16 18:03:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:35,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:35,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529913167] [2020-01-16 18:03:35,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:35,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:35,826 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:03:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:36,012 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-01-16 18:03:36,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:36,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:36,016 INFO L225 Difference]: With dead ends: 1364 [2020-01-16 18:03:36,016 INFO L226 Difference]: Without dead ends: 1352 [2020-01-16 18:03:36,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-01-16 18:03:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-01-16 18:03:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:03:36,056 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:03:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:36,056 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:03:36,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:03:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:36,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:36,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] [2020-01-16 18:03:36,058 INFO L426 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash -342286323, now seen corresponding path program 94 times [2020-01-16 18:03:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:36,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296773637] [2020-01-16 18:03:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:36,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296773637] [2020-01-16 18:03:36,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:36,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:36,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303598993] [2020-01-16 18:03:36,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:36,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:36,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:36,496 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:03:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:36,662 INFO L93 Difference]: Finished difference Result 1366 states and 4823 transitions. [2020-01-16 18:03:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:36,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:36,666 INFO L225 Difference]: With dead ends: 1366 [2020-01-16 18:03:36,666 INFO L226 Difference]: Without dead ends: 1349 [2020-01-16 18:03:36,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-01-16 18:03:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 785. [2020-01-16 18:03:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-01-16 18:03:36,688 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-01-16 18:03:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:36,688 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-01-16 18:03:36,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-01-16 18:03:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:36,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:36,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] [2020-01-16 18:03:36,690 INFO L426 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 741302161, now seen corresponding path program 95 times [2020-01-16 18:03:36,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:36,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372781771] [2020-01-16 18:03:36,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:37,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372781771] [2020-01-16 18:03:37,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:37,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:37,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319550391] [2020-01-16 18:03:37,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:37,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:37,146 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:03:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:37,349 INFO L93 Difference]: Finished difference Result 1374 states and 4841 transitions. [2020-01-16 18:03:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:37,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:37,353 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:03:37,354 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:03:37,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:03:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-01-16 18:03:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-01-16 18:03:37,376 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:37,377 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-01-16 18:03:37,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-01-16 18:03:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:37,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:37,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] [2020-01-16 18:03:37,378 INFO L426 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1942724177, now seen corresponding path program 96 times [2020-01-16 18:03:37,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:37,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397649295] [2020-01-16 18:03:37,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:37,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-01-16 18:03:37,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397649295] [2020-01-16 18:03:37,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:37,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:37,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912822709] [2020-01-16 18:03:37,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:37,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:37,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:37,811 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:37,996 INFO L93 Difference]: Finished difference Result 1372 states and 4832 transitions. [2020-01-16 18:03:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:37,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:38,000 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:03:38,000 INFO L226 Difference]: Without dead ends: 1347 [2020-01-16 18:03:38,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-01-16 18:03:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2020-01-16 18:03:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:03:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3119 transitions. [2020-01-16 18:03:38,022 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3119 transitions. Word has length 25 [2020-01-16 18:03:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:38,022 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3119 transitions. [2020-01-16 18:03:38,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3119 transitions. [2020-01-16 18:03:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:38,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:38,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:38,024 INFO L426 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2073967317, now seen corresponding path program 97 times [2020-01-16 18:03:38,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:38,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357187898] [2020-01-16 18:03:38,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:38,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357187898] [2020-01-16 18:03:38,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:38,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:38,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925569737] [2020-01-16 18:03:38,466 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:38,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:38,466 INFO L87 Difference]: Start difference. First operand 779 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:03:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:38,645 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-01-16 18:03:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:38,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:38,650 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:03:38,650 INFO L226 Difference]: Without dead ends: 1361 [2020-01-16 18:03:38,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-01-16 18:03:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 788. [2020-01-16 18:03:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-01-16 18:03:38,676 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-01-16 18:03:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:38,677 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-01-16 18:03:38,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-01-16 18:03:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:38,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:38,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:38,678 INFO L426 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash -610059021, now seen corresponding path program 98 times [2020-01-16 18:03:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:38,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612152764] [2020-01-16 18:03:38,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:39,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612152764] [2020-01-16 18:03:39,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:39,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:39,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602918358] [2020-01-16 18:03:39,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:39,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:39,125 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:03:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:39,281 INFO L93 Difference]: Finished difference Result 1373 states and 4852 transitions. [2020-01-16 18:03:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:39,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:39,285 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:03:39,285 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:03:39,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:03:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-01-16 18:03:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-01-16 18:03:39,308 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:39,308 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-01-16 18:03:39,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-01-16 18:03:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:39,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:39,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] [2020-01-16 18:03:39,309 INFO L426 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:39,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash 473529463, now seen corresponding path program 99 times [2020-01-16 18:03:39,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:39,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799521970] [2020-01-16 18:03:39,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:39,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799521970] [2020-01-16 18:03:39,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:39,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:39,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234656444] [2020-01-16 18:03:39,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:39,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:39,786 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:39,948 INFO L93 Difference]: Finished difference Result 1383 states and 4875 transitions. [2020-01-16 18:03:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:39,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:39,952 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:03:39,952 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:03:39,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:03:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 791. [2020-01-16 18:03:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-01-16 18:03:39,975 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-01-16 18:03:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:39,975 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-01-16 18:03:39,975 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-01-16 18:03:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:39,976 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:39,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:39,976 INFO L426 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash -599555917, now seen corresponding path program 100 times [2020-01-16 18:03:39,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:39,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203949421] [2020-01-16 18:03:39,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:40,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-01-16 18:03:40,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203949421] [2020-01-16 18:03:40,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:40,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:40,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38908962] [2020-01-16 18:03:40,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:40,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:40,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:40,444 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:03:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:40,624 INFO L93 Difference]: Finished difference Result 1384 states and 4871 transitions. [2020-01-16 18:03:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:40,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:40,629 INFO L225 Difference]: With dead ends: 1384 [2020-01-16 18:03:40,629 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:03:40,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:03:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 785. [2020-01-16 18:03:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:03:40,651 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:03:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:40,652 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:03:40,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:03:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:40,653 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:40,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:40,653 INFO L426 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 484032567, now seen corresponding path program 101 times [2020-01-16 18:03:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737326311] [2020-01-16 18:03:40,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:41,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737326311] [2020-01-16 18:03:41,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:41,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120599703] [2020-01-16 18:03:41,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:41,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:41,113 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:03:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:41,258 INFO L93 Difference]: Finished difference Result 1374 states and 4851 transitions. [2020-01-16 18:03:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:41,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:41,263 INFO L225 Difference]: With dead ends: 1374 [2020-01-16 18:03:41,263 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:03:41,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:03:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 788. [2020-01-16 18:03:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-01-16 18:03:41,285 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-01-16 18:03:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:41,286 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-01-16 18:03:41,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-01-16 18:03:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:41,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:41,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] [2020-01-16 18:03:41,287 INFO L426 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2094973525, now seen corresponding path program 102 times [2020-01-16 18:03:41,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:41,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631577267] [2020-01-16 18:03:41,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:41,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631577267] [2020-01-16 18:03:41,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:41,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:41,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078760178] [2020-01-16 18:03:41,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:41,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:41,746 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:03:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:41,903 INFO L93 Difference]: Finished difference Result 1378 states and 4856 transitions. [2020-01-16 18:03:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:41,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:41,908 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:03:41,908 INFO L226 Difference]: Without dead ends: 1356 [2020-01-16 18:03:41,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-01-16 18:03:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 782. [2020-01-16 18:03:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-01-16 18:03:41,932 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-01-16 18:03:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:41,932 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-01-16 18:03:41,932 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-01-16 18:03:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:41,934 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:41,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:41,935 INFO L426 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash -294965901, now seen corresponding path program 103 times [2020-01-16 18:03:41,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:41,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136701023] [2020-01-16 18:03:41,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:42,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136701023] [2020-01-16 18:03:42,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:42,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:42,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491252893] [2020-01-16 18:03:42,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:42,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:42,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:42,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:42,398 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:03:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:42,576 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-01-16 18:03:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:42,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:42,581 INFO L225 Difference]: With dead ends: 1373 [2020-01-16 18:03:42,581 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:03:42,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:03:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:03:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:03:42,603 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:03:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:42,603 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:03:42,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:03:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:42,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:42,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:42,605 INFO L426 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1315975057, now seen corresponding path program 104 times [2020-01-16 18:03:42,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:42,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110649068] [2020-01-16 18:03:42,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:43,063 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:03:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:43,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110649068] [2020-01-16 18:03:43,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:43,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:43,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860366894] [2020-01-16 18:03:43,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:43,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:43,069 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:03:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:43,237 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-01-16 18:03:43,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:43,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:43,241 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:03:43,241 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:03:43,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:03:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-01-16 18:03:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-01-16 18:03:43,264 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-01-16 18:03:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:43,264 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-01-16 18:03:43,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-01-16 18:03:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:43,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:43,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:43,266 INFO L426 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash 799125687, now seen corresponding path program 105 times [2020-01-16 18:03:43,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:43,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123892182] [2020-01-16 18:03:43,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:43,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123892182] [2020-01-16 18:03:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:43,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301853041] [2020-01-16 18:03:43,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:43,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:43,751 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:03:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:43,921 INFO L93 Difference]: Finished difference Result 1377 states and 4858 transitions. [2020-01-16 18:03:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:43,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:43,925 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:03:43,926 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:03:43,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:03:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 790. [2020-01-16 18:03:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-01-16 18:03:43,954 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-01-16 18:03:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:43,954 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-01-16 18:03:43,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-01-16 18:03:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:43,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:43,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] [2020-01-16 18:03:43,956 INFO L426 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1336981265, now seen corresponding path program 106 times [2020-01-16 18:03:43,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:43,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776671072] [2020-01-16 18:03:43,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:44,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776671072] [2020-01-16 18:03:44,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:44,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:44,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234178155] [2020-01-16 18:03:44,420 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:44,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:44,421 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:03:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:44,578 INFO L93 Difference]: Finished difference Result 1376 states and 4851 transitions. [2020-01-16 18:03:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:44,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:44,583 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:03:44,583 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:03:44,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:03:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-01-16 18:03:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:03:44,605 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:03:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:44,605 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:03:44,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:03:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:44,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:44,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:44,607 INFO L426 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:44,607 INFO L82 PathProgramCache]: Analyzing trace with hash 809628791, now seen corresponding path program 107 times [2020-01-16 18:03:44,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:44,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931240426] [2020-01-16 18:03:44,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:45,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931240426] [2020-01-16 18:03:45,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:45,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:45,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764631438] [2020-01-16 18:03:45,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:45,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:45,047 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:03:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:45,216 INFO L93 Difference]: Finished difference Result 1369 states and 4837 transitions. [2020-01-16 18:03:45,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:45,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:45,220 INFO L225 Difference]: With dead ends: 1369 [2020-01-16 18:03:45,220 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:03:45,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:03:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-01-16 18:03:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:03:45,242 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:03:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:45,243 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:03:45,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:03:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:45,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:45,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:45,244 INFO L426 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash -263456589, now seen corresponding path program 108 times [2020-01-16 18:03:45,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:45,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609553432] [2020-01-16 18:03:45,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:45,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-01-16 18:03:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609553432] [2020-01-16 18:03:45,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:45,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:45,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473499101] [2020-01-16 18:03:45,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:45,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:45,679 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:03:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:45,844 INFO L93 Difference]: Finished difference Result 1371 states and 4838 transitions. [2020-01-16 18:03:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:45,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:45,849 INFO L225 Difference]: With dead ends: 1371 [2020-01-16 18:03:45,849 INFO L226 Difference]: Without dead ends: 1351 [2020-01-16 18:03:45,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-01-16 18:03:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 782. [2020-01-16 18:03:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:03:45,874 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:03:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:45,874 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:03:45,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:03:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:45,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:45,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:45,876 INFO L426 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash 30630323, now seen corresponding path program 109 times [2020-01-16 18:03:45,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:45,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482728568] [2020-01-16 18:03:45,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:46,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482728568] [2020-01-16 18:03:46,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:46,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:46,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265073781] [2020-01-16 18:03:46,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:46,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:46,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:46,339 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:03:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:46,531 INFO L93 Difference]: Finished difference Result 1391 states and 4896 transitions. [2020-01-16 18:03:46,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:46,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:46,535 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:03:46,535 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:03:46,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:03:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 793. [2020-01-16 18:03:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:03:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:03:46,558 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:03:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:46,558 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:03:46,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:03:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:46,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:46,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:46,559 INFO L426 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1042455057, now seen corresponding path program 110 times [2020-01-16 18:03:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111580324] [2020-01-16 18:03:46,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:47,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111580324] [2020-01-16 18:03:47,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:47,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:47,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202928321] [2020-01-16 18:03:47,017 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:47,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:47,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:47,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:47,017 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:03:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:47,184 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-01-16 18:03:47,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:47,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:47,188 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:03:47,188 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:03:47,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:03:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:03:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:03:47,210 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:03:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:47,210 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:03:47,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:03:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:47,211 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:47,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:47,212 INFO L426 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1569807531, now seen corresponding path program 111 times [2020-01-16 18:03:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:47,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842492612] [2020-01-16 18:03:47,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:47,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842492612] [2020-01-16 18:03:47,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:47,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:47,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909606259] [2020-01-16 18:03:47,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:47,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:47,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:47,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:47,663 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:03:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:47,835 INFO L93 Difference]: Finished difference Result 1388 states and 4884 transitions. [2020-01-16 18:03:47,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:47,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:47,839 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:03:47,839 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:03:47,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:03:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 792. [2020-01-16 18:03:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:03:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3150 transitions. [2020-01-16 18:03:47,862 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3150 transitions. Word has length 25 [2020-01-16 18:03:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:47,862 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3150 transitions. [2020-01-16 18:03:47,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3150 transitions. [2020-01-16 18:03:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:47,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:47,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:47,864 INFO L426 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1031951953, now seen corresponding path program 112 times [2020-01-16 18:03:47,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:47,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329004078] [2020-01-16 18:03:47,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:48,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329004078] [2020-01-16 18:03:48,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:48,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:48,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768760981] [2020-01-16 18:03:48,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:48,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:48,332 INFO L87 Difference]: Start difference. First operand 792 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:03:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:48,498 INFO L93 Difference]: Finished difference Result 1387 states and 4877 transitions. [2020-01-16 18:03:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:48,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:48,503 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:03:48,503 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:03:48,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:03:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-01-16 18:03:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:03:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-01-16 18:03:48,526 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-01-16 18:03:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:48,526 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-01-16 18:03:48,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-01-16 18:03:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:48,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:48,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:48,527 INFO L426 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1548801323, now seen corresponding path program 113 times [2020-01-16 18:03:48,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:48,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401781804] [2020-01-16 18:03:48,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:48,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-01-16 18:03:48,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401781804] [2020-01-16 18:03:48,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:48,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:48,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857371933] [2020-01-16 18:03:48,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:48,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:48,980 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:03:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:49,132 INFO L93 Difference]: Finished difference Result 1390 states and 4883 transitions. [2020-01-16 18:03:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:49,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:49,137 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:03:49,137 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:03:49,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:03:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-01-16 18:03:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:03:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:03:49,162 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:03:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:49,162 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:03:49,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:03:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:49,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:49,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:49,164 INFO L426 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 62139635, now seen corresponding path program 114 times [2020-01-16 18:03:49,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:49,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573178988] [2020-01-16 18:03:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:49,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-01-16 18:03:49,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573178988] [2020-01-16 18:03:49,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:49,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:49,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318975650] [2020-01-16 18:03:49,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:49,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:49,626 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:03:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:49,817 INFO L93 Difference]: Finished difference Result 1388 states and 4874 transitions. [2020-01-16 18:03:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:49,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:49,821 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:03:49,821 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:03:49,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:03:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 782. [2020-01-16 18:03:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:03:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-01-16 18:03:49,844 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-01-16 18:03:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:49,844 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-01-16 18:03:49,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-01-16 18:03:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:49,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:49,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:49,846 INFO L426 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1967167505, now seen corresponding path program 115 times [2020-01-16 18:03:49,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:49,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988689837] [2020-01-16 18:03:49,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:50,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988689837] [2020-01-16 18:03:50,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:50,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:50,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856938998] [2020-01-16 18:03:50,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:50,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:50,297 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:03:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:50,452 INFO L93 Difference]: Finished difference Result 1372 states and 4843 transitions. [2020-01-16 18:03:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:50,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:50,456 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:03:50,456 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:03:50,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:03:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 788. [2020-01-16 18:03:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-01-16 18:03:50,479 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-01-16 18:03:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:50,479 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-01-16 18:03:50,479 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-01-16 18:03:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:50,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:50,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:50,481 INFO L426 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:50,481 INFO L82 PathProgramCache]: Analyzing trace with hash -716858833, now seen corresponding path program 116 times [2020-01-16 18:03:50,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:50,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681575076] [2020-01-16 18:03:50,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:50,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681575076] [2020-01-16 18:03:50,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:50,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:50,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201974944] [2020-01-16 18:03:50,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:50,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:50,930 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:03:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:51,086 INFO L93 Difference]: Finished difference Result 1376 states and 4848 transitions. [2020-01-16 18:03:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:51,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:51,090 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:03:51,090 INFO L226 Difference]: Without dead ends: 1357 [2020-01-16 18:03:51,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-01-16 18:03:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-01-16 18:03:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-01-16 18:03:51,119 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-01-16 18:03:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:51,119 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-01-16 18:03:51,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-01-16 18:03:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:51,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:51,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:51,121 INFO L426 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 366729651, now seen corresponding path program 117 times [2020-01-16 18:03:51,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:51,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367518308] [2020-01-16 18:03:51,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:51,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-01-16 18:03:51,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367518308] [2020-01-16 18:03:51,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:51,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:51,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79207074] [2020-01-16 18:03:51,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:51,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:51,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:51,554 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:03:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:51,741 INFO L93 Difference]: Finished difference Result 1370 states and 4836 transitions. [2020-01-16 18:03:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:51,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:51,745 INFO L225 Difference]: With dead ends: 1370 [2020-01-16 18:03:51,745 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:03:51,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:03:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-01-16 18:03:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-01-16 18:03:51,767 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-01-16 18:03:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:51,768 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-01-16 18:03:51,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-01-16 18:03:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:51,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:51,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:51,769 INFO L426 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash -706355729, now seen corresponding path program 118 times [2020-01-16 18:03:51,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:51,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693441707] [2020-01-16 18:03:51,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:52,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693441707] [2020-01-16 18:03:52,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:52,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:52,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361542050] [2020-01-16 18:03:52,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:52,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:52,212 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:03:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:52,395 INFO L93 Difference]: Finished difference Result 1372 states and 4837 transitions. [2020-01-16 18:03:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:52,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:52,399 INFO L225 Difference]: With dead ends: 1372 [2020-01-16 18:03:52,399 INFO L226 Difference]: Without dead ends: 1355 [2020-01-16 18:03:52,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-01-16 18:03:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-01-16 18:03:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-01-16 18:03:52,421 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-01-16 18:03:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:52,421 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-01-16 18:03:52,422 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-01-16 18:03:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:52,423 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:52,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:52,423 INFO L426 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 377232755, now seen corresponding path program 119 times [2020-01-16 18:03:52,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434726259] [2020-01-16 18:03:52,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:52,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-01-16 18:03:52,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434726259] [2020-01-16 18:03:52,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:52,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:52,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179347040] [2020-01-16 18:03:52,862 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:52,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:52,863 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:03:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:53,048 INFO L93 Difference]: Finished difference Result 1380 states and 4855 transitions. [2020-01-16 18:03:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:53,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:53,052 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:03:53,052 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:03:53,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:03:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-01-16 18:03:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:03:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3138 transitions. [2020-01-16 18:03:53,074 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3138 transitions. Word has length 25 [2020-01-16 18:03:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:53,074 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3138 transitions. [2020-01-16 18:03:53,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3138 transitions. [2020-01-16 18:03:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:53,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:53,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:53,076 INFO L426 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1988173713, now seen corresponding path program 120 times [2020-01-16 18:03:53,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:53,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125620322] [2020-01-16 18:03:53,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:53,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125620322] [2020-01-16 18:03:53,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:53,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:53,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000238167] [2020-01-16 18:03:53,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:53,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:53,512 INFO L87 Difference]: Start difference. First operand 790 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:03:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:53,684 INFO L93 Difference]: Finished difference Result 1378 states and 4846 transitions. [2020-01-16 18:03:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:53,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:53,688 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:03:53,688 INFO L226 Difference]: Without dead ends: 1350 [2020-01-16 18:03:53,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-01-16 18:03:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 776. [2020-01-16 18:03:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:03:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3111 transitions. [2020-01-16 18:03:53,711 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3111 transitions. Word has length 25 [2020-01-16 18:03:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:53,711 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3111 transitions. [2020-01-16 18:03:53,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3111 transitions. [2020-01-16 18:03:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:53,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:53,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:53,713 INFO L426 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1635199863, now seen corresponding path program 121 times [2020-01-16 18:03:53,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:53,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735037940] [2020-01-16 18:03:53,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:54,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-01-16 18:03:54,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735037940] [2020-01-16 18:03:54,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:54,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:54,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480753488] [2020-01-16 18:03:54,161 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:54,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:54,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:54,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:54,161 INFO L87 Difference]: Start difference. First operand 776 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:03:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:54,324 INFO L93 Difference]: Finished difference Result 1402 states and 4942 transitions. [2020-01-16 18:03:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:54,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:54,329 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:03:54,329 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:03:54,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:03:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 792. [2020-01-16 18:03:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:03:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3172 transitions. [2020-01-16 18:03:54,353 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3172 transitions. Word has length 25 [2020-01-16 18:03:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:54,353 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3172 transitions. [2020-01-16 18:03:54,353 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3172 transitions. [2020-01-16 18:03:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:54,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:54,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:54,355 INFO L426 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1689515819, now seen corresponding path program 122 times [2020-01-16 18:03:54,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:54,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861289653] [2020-01-16 18:03:54,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:54,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-01-16 18:03:54,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861289653] [2020-01-16 18:03:54,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:54,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:54,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231872647] [2020-01-16 18:03:54,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:54,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:54,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:54,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:54,810 INFO L87 Difference]: Start difference. First operand 792 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:03:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:54,999 INFO L93 Difference]: Finished difference Result 1404 states and 4942 transitions. [2020-01-16 18:03:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:54,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:55,003 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:03:55,003 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:03:55,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:03:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:03:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3162 transitions. [2020-01-16 18:03:55,027 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:55,027 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3162 transitions. [2020-01-16 18:03:55,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3162 transitions. [2020-01-16 18:03:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:55,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:55,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:55,029 INFO L426 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -733733355, now seen corresponding path program 123 times [2020-01-16 18:03:55,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:55,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919860754] [2020-01-16 18:03:55,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:55,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-01-16 18:03:55,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919860754] [2020-01-16 18:03:55,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:55,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:55,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404034288] [2020-01-16 18:03:55,499 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:55,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:55,500 INFO L87 Difference]: Start difference. First operand 788 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:03:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:55,686 INFO L93 Difference]: Finished difference Result 1398 states and 4930 transitions. [2020-01-16 18:03:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:55,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:55,690 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:03:55,690 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:03:55,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:03:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 791. [2020-01-16 18:03:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3167 transitions. [2020-01-16 18:03:55,712 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3167 transitions. Word has length 25 [2020-01-16 18:03:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:55,712 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3167 transitions. [2020-01-16 18:03:55,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3167 transitions. [2020-01-16 18:03:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:55,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:55,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:55,713 INFO L426 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 247021363, now seen corresponding path program 124 times [2020-01-16 18:03:55,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:55,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9071619] [2020-01-16 18:03:55,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:56,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9071619] [2020-01-16 18:03:56,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:56,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522668770] [2020-01-16 18:03:56,169 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:56,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:56,170 INFO L87 Difference]: Start difference. First operand 791 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:03:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:56,366 INFO L93 Difference]: Finished difference Result 1397 states and 4925 transitions. [2020-01-16 18:03:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:56,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:56,369 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:03:56,370 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:03:56,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:03:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-01-16 18:03:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:03:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3159 transitions. [2020-01-16 18:03:56,393 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3159 transitions. Word has length 25 [2020-01-16 18:03:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:56,393 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3159 transitions. [2020-01-16 18:03:56,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3159 transitions. [2020-01-16 18:03:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:56,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:56,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:56,395 INFO L426 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1350890633, now seen corresponding path program 125 times [2020-01-16 18:03:56,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:56,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756051346] [2020-01-16 18:03:56,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:56,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756051346] [2020-01-16 18:03:56,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:56,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:56,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064368231] [2020-01-16 18:03:56,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:56,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:56,853 INFO L87 Difference]: Start difference. First operand 788 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:03:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:57,025 INFO L93 Difference]: Finished difference Result 1402 states and 4935 transitions. [2020-01-16 18:03:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:57,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:57,029 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:03:57,029 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:03:57,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:03:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 791. [2020-01-16 18:03:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:03:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-01-16 18:03:57,052 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-01-16 18:03:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:57,052 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-01-16 18:03:57,052 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-01-16 18:03:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:57,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:57,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:57,053 INFO L426 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash 260050325, now seen corresponding path program 126 times [2020-01-16 18:03:57,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:57,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518624361] [2020-01-16 18:03:57,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:57,554 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-01-16 18:03:57,701 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:03:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:57,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518624361] [2020-01-16 18:03:57,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:57,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:57,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056495963] [2020-01-16 18:03:57,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:57,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:57,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:57,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:57,713 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:03:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:57,937 INFO L93 Difference]: Finished difference Result 1399 states and 4926 transitions. [2020-01-16 18:03:57,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:57,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:57,942 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:03:57,943 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:03:57,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:03:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 785. [2020-01-16 18:03:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:03:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3151 transitions. [2020-01-16 18:03:57,995 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3151 transitions. Word has length 25 [2020-01-16 18:03:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:57,996 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3151 transitions. [2020-01-16 18:03:57,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3151 transitions. [2020-01-16 18:03:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:57,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:58,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:58,002 INFO L426 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1212714137, now seen corresponding path program 127 times [2020-01-16 18:03:58,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:58,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596249991] [2020-01-16 18:03:58,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:58,631 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:03:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:58,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596249991] [2020-01-16 18:03:58,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:58,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:58,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786700750] [2020-01-16 18:03:58,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:58,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:58,644 INFO L87 Difference]: Start difference. First operand 785 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:03:58,914 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2020-01-16 18:03:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:58,935 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-01-16 18:03:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:58,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:58,941 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:03:58,942 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:03:58,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:03:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:03:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:03:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-01-16 18:03:58,998 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-01-16 18:03:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:58,999 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-01-16 18:03:58,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-01-16 18:03:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:59,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:59,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:03:59,002 INFO L426 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2112001545, now seen corresponding path program 128 times [2020-01-16 18:03:59,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:59,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525266660] [2020-01-16 18:03:59,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:03:59,525 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:03:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:03:59,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525266660] [2020-01-16 18:03:59,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:03:59,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:03:59,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519855011] [2020-01-16 18:03:59,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:03:59,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:03:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:03:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:03:59,632 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:03:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:03:59,801 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-01-16 18:03:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:03:59,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:03:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:03:59,805 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:03:59,805 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:03:59,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:03:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:03:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:03:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:03:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3162 transitions. [2020-01-16 18:03:59,835 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3162 transitions. Word has length 25 [2020-01-16 18:03:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:03:59,835 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3162 transitions. [2020-01-16 18:03:59,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:03:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3162 transitions. [2020-01-16 18:03:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:03:59,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:03:59,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] [2020-01-16 18:03:59,837 INFO L426 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:03:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:03:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 769814997, now seen corresponding path program 129 times [2020-01-16 18:03:59,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:03:59,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191503033] [2020-01-16 18:03:59,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:03:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:00,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191503033] [2020-01-16 18:04:00,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:00,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:00,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960869657] [2020-01-16 18:04:00,293 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:00,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:00,293 INFO L87 Difference]: Start difference. First operand 789 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:04:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:00,460 INFO L93 Difference]: Finished difference Result 1412 states and 4961 transitions. [2020-01-16 18:04:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:00,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:00,464 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:04:00,465 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:04:00,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:04:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 793. [2020-01-16 18:04:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-01-16 18:04:00,487 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-01-16 18:04:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:00,487 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-01-16 18:04:00,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-01-16 18:04:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:00,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:00,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:00,488 INFO L426 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1761072819, now seen corresponding path program 130 times [2020-01-16 18:04:00,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:00,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889403830] [2020-01-16 18:04:00,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:00,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889403830] [2020-01-16 18:04:00,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:00,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:00,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613036132] [2020-01-16 18:04:00,953 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:00,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:00,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:00,954 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:04:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:01,167 INFO L93 Difference]: Finished difference Result 1415 states and 4963 transitions. [2020-01-16 18:04:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:01,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:01,171 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:04:01,171 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:04:01,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:04:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 789. [2020-01-16 18:04:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3158 transitions. [2020-01-16 18:04:01,194 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3158 transitions. Word has length 25 [2020-01-16 18:04:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:01,194 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3158 transitions. [2020-01-16 18:04:01,194 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3158 transitions. [2020-01-16 18:04:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:01,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:01,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:01,195 INFO L426 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1447780135, now seen corresponding path program 131 times [2020-01-16 18:04:01,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:01,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684545604] [2020-01-16 18:04:01,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:01,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684545604] [2020-01-16 18:04:01,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:01,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:01,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087884188] [2020-01-16 18:04:01,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:01,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:01,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:01,663 INFO L87 Difference]: Start difference. First operand 789 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:04:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:01,828 INFO L93 Difference]: Finished difference Result 1418 states and 4971 transitions. [2020-01-16 18:04:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:01,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:01,833 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:04:01,833 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:04:01,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:04:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2020-01-16 18:04:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3169 transitions. [2020-01-16 18:04:01,859 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3169 transitions. Word has length 25 [2020-01-16 18:04:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:01,859 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3169 transitions. [2020-01-16 18:04:01,859 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3169 transitions. [2020-01-16 18:04:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:01,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:01,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:01,861 INFO L426 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1774101781, now seen corresponding path program 132 times [2020-01-16 18:04:01,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:01,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5203310] [2020-01-16 18:04:01,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:02,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5203310] [2020-01-16 18:04:02,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:02,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:02,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007199039] [2020-01-16 18:04:02,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:02,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:02,343 INFO L87 Difference]: Start difference. First operand 795 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:04:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:02,557 INFO L93 Difference]: Finished difference Result 1419 states and 4967 transitions. [2020-01-16 18:04:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:02,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:02,561 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:04:02,562 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:04:02,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:04:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 785. [2020-01-16 18:04:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:04:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3148 transitions. [2020-01-16 18:04:02,585 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3148 transitions. Word has length 25 [2020-01-16 18:04:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:02,585 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3148 transitions. [2020-01-16 18:04:02,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3148 transitions. [2020-01-16 18:04:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:02,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:02,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:02,586 INFO L426 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1578704807, now seen corresponding path program 133 times [2020-01-16 18:04:02,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:02,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480484632] [2020-01-16 18:04:02,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:03,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480484632] [2020-01-16 18:04:03,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:03,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:03,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319830670] [2020-01-16 18:04:03,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:03,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:03,036 INFO L87 Difference]: Start difference. First operand 785 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:04:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:03,243 INFO L93 Difference]: Finished difference Result 1399 states and 4929 transitions. [2020-01-16 18:04:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:03,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:03,247 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:04:03,247 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:04:03,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:04:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 791. [2020-01-16 18:04:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-01-16 18:04:03,271 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-01-16 18:04:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:03,271 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-01-16 18:04:03,271 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-01-16 18:04:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:03,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:03,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:03,273 INFO L426 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -597950089, now seen corresponding path program 134 times [2020-01-16 18:04:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334441959] [2020-01-16 18:04:03,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:03,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334441959] [2020-01-16 18:04:03,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:03,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:03,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762644845] [2020-01-16 18:04:03,748 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:03,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:03,749 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:04:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:03,962 INFO L93 Difference]: Finished difference Result 1398 states and 4924 transitions. [2020-01-16 18:04:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:03,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:03,966 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:04:03,967 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:04:03,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:04:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:04:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:04:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3156 transitions. [2020-01-16 18:04:03,989 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3156 transitions. Word has length 25 [2020-01-16 18:04:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:03,989 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3156 transitions. [2020-01-16 18:04:03,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3156 transitions. [2020-01-16 18:04:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:03,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:03,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] [2020-01-16 18:04:03,990 INFO L426 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 347329271, now seen corresponding path program 135 times [2020-01-16 18:04:03,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:03,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221207753] [2020-01-16 18:04:03,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:04,442 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-01-16 18:04:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:04,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221207753] [2020-01-16 18:04:04,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:04,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:04,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345959832] [2020-01-16 18:04:04,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:04,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:04,569 INFO L87 Difference]: Start difference. First operand 788 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:04:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:04,721 INFO L93 Difference]: Finished difference Result 1404 states and 4937 transitions. [2020-01-16 18:04:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:04,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:04,725 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:04:04,726 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:04:04,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:04:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 792. [2020-01-16 18:04:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:04:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3163 transitions. [2020-01-16 18:04:04,759 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3163 transitions. Word has length 25 [2020-01-16 18:04:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:04,759 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3163 transitions. [2020-01-16 18:04:04,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3163 transitions. [2020-01-16 18:04:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:04,761 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:04,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:04,761 INFO L426 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1338587093, now seen corresponding path program 136 times [2020-01-16 18:04:04,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:04,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809930341] [2020-01-16 18:04:04,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:05,210 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-01-16 18:04:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:05,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809930341] [2020-01-16 18:04:05,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:05,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:05,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950570125] [2020-01-16 18:04:05,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:05,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:05,321 INFO L87 Difference]: Start difference. First operand 792 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:04:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:05,542 INFO L93 Difference]: Finished difference Result 1407 states and 4939 transitions. [2020-01-16 18:04:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:05,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:05,545 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:04:05,545 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:04:05,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:04:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 788. [2020-01-16 18:04:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:04:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-01-16 18:04:05,576 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-01-16 18:04:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:05,577 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-01-16 18:04:05,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-01-16 18:04:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:05,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:05,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] [2020-01-16 18:04:05,578 INFO L426 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 66271321, now seen corresponding path program 137 times [2020-01-16 18:04:05,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:05,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433842267] [2020-01-16 18:04:05,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:06,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433842267] [2020-01-16 18:04:06,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:06,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:06,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148371575] [2020-01-16 18:04:06,031 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:06,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:06,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:06,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:06,032 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:04:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:06,244 INFO L93 Difference]: Finished difference Result 1401 states and 4927 transitions. [2020-01-16 18:04:06,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:06,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:06,248 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:04:06,248 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:04:06,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:04:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-01-16 18:04:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-01-16 18:04:06,271 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-01-16 18:04:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:06,271 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-01-16 18:04:06,271 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-01-16 18:04:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:06,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:06,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:06,273 INFO L426 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1677212279, now seen corresponding path program 138 times [2020-01-16 18:04:06,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:06,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553590918] [2020-01-16 18:04:06,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:06,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553590918] [2020-01-16 18:04:06,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:06,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:06,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40042740] [2020-01-16 18:04:06,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:06,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:06,756 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:04:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:06,932 INFO L93 Difference]: Finished difference Result 1405 states and 4932 transitions. [2020-01-16 18:04:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:06,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:06,936 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:04:06,936 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:04:06,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:04:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 785. [2020-01-16 18:04:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:04:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3145 transitions. [2020-01-16 18:04:06,959 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3145 transitions. Word has length 25 [2020-01-16 18:04:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:06,959 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3145 transitions. [2020-01-16 18:04:06,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3145 transitions. [2020-01-16 18:04:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:06,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:06,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] [2020-01-16 18:04:06,961 INFO L426 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2060103893, now seen corresponding path program 139 times [2020-01-16 18:04:06,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:06,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830546773] [2020-01-16 18:04:06,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:07,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830546773] [2020-01-16 18:04:07,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:07,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:07,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751304672] [2020-01-16 18:04:07,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:07,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:07,436 INFO L87 Difference]: Start difference. First operand 785 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:04:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:07,641 INFO L93 Difference]: Finished difference Result 1407 states and 4944 transitions. [2020-01-16 18:04:07,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:07,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:07,645 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:04:07,645 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:04:07,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:04:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-01-16 18:04:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-01-16 18:04:07,668 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-01-16 18:04:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:07,668 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-01-16 18:04:07,668 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-01-16 18:04:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:07,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:07,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:07,669 INFO L426 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash -623922445, now seen corresponding path program 140 times [2020-01-16 18:04:07,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:07,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793252299] [2020-01-16 18:04:07,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:08,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793252299] [2020-01-16 18:04:08,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:08,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:08,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643179239] [2020-01-16 18:04:08,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:08,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:08,134 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:04:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:08,326 INFO L93 Difference]: Finished difference Result 1404 states and 4935 transitions. [2020-01-16 18:04:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:08,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:08,330 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:04:08,330 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:04:08,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:04:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-01-16 18:04:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:04:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-01-16 18:04:08,351 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-01-16 18:04:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:08,351 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-01-16 18:04:08,351 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-01-16 18:04:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:08,354 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:08,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:08,354 INFO L426 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:08,355 INFO L82 PathProgramCache]: Analyzing trace with hash 459666039, now seen corresponding path program 141 times [2020-01-16 18:04:08,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:08,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608182833] [2020-01-16 18:04:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:08,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-01-16 18:04:08,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608182833] [2020-01-16 18:04:08,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:08,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:08,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756611571] [2020-01-16 18:04:08,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:08,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:08,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:08,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:08,809 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:04:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:09,001 INFO L93 Difference]: Finished difference Result 1414 states and 4958 transitions. [2020-01-16 18:04:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:09,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:09,005 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:04:09,005 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:04:09,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:04:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-01-16 18:04:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:04:09,028 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:04:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:09,028 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:04:09,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:04:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:09,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:09,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:09,029 INFO L426 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash -613419341, now seen corresponding path program 142 times [2020-01-16 18:04:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:09,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481140246] [2020-01-16 18:04:09,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:09,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481140246] [2020-01-16 18:04:09,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:09,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:09,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642499832] [2020-01-16 18:04:09,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:09,497 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:04:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:09,706 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-01-16 18:04:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:09,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:09,710 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:04:09,710 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:04:09,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:04:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 788. [2020-01-16 18:04:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:04:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3150 transitions. [2020-01-16 18:04:09,732 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3150 transitions. Word has length 25 [2020-01-16 18:04:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:09,733 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3150 transitions. [2020-01-16 18:04:09,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3150 transitions. [2020-01-16 18:04:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:09,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:09,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:09,734 INFO L426 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 470169143, now seen corresponding path program 143 times [2020-01-16 18:04:09,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:09,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000505386] [2020-01-16 18:04:09,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:10,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-01-16 18:04:10,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000505386] [2020-01-16 18:04:10,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:10,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:10,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301955737] [2020-01-16 18:04:10,198 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:10,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:10,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:10,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:10,199 INFO L87 Difference]: Start difference. First operand 788 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:04:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:10,408 INFO L93 Difference]: Finished difference Result 1405 states and 4934 transitions. [2020-01-16 18:04:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:10,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:10,412 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:04:10,412 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:04:10,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:04:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 791. [2020-01-16 18:04:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-01-16 18:04:10,435 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-01-16 18:04:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:10,435 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-01-16 18:04:10,435 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-01-16 18:04:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:10,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:10,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:10,436 INFO L426 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2081110101, now seen corresponding path program 144 times [2020-01-16 18:04:10,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:10,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229947977] [2020-01-16 18:04:10,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:10,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229947977] [2020-01-16 18:04:10,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:10,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:10,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613606046] [2020-01-16 18:04:10,887 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:10,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:10,888 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:04:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:11,103 INFO L93 Difference]: Finished difference Result 1409 states and 4939 transitions. [2020-01-16 18:04:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:11,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:11,107 INFO L225 Difference]: With dead ends: 1409 [2020-01-16 18:04:11,108 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:04:11,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:04:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 782. [2020-01-16 18:04:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:04:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3137 transitions. [2020-01-16 18:04:11,131 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3137 transitions. Word has length 25 [2020-01-16 18:04:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:11,131 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3137 transitions. [2020-01-16 18:04:11,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3137 transitions. [2020-01-16 18:04:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:11,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:11,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] [2020-01-16 18:04:11,132 INFO L426 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1210888627, now seen corresponding path program 145 times [2020-01-16 18:04:11,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:11,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538181743] [2020-01-16 18:04:11,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:11,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538181743] [2020-01-16 18:04:11,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:11,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:11,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490139655] [2020-01-16 18:04:11,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:11,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:11,576 INFO L87 Difference]: Start difference. First operand 782 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:04:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:11,798 INFO L93 Difference]: Finished difference Result 1411 states and 4961 transitions. [2020-01-16 18:04:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:11,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:11,803 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:04:11,803 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:04:11,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:04:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:04:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-01-16 18:04:11,825 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-01-16 18:04:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:11,825 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-01-16 18:04:11,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-01-16 18:04:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:11,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:11,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:11,827 INFO L426 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2113827055, now seen corresponding path program 146 times [2020-01-16 18:04:11,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:11,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471315378] [2020-01-16 18:04:11,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:12,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471315378] [2020-01-16 18:04:12,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:12,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:12,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090659954] [2020-01-16 18:04:12,272 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:12,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:12,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:12,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:12,272 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:04:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:12,488 INFO L93 Difference]: Finished difference Result 1413 states and 4961 transitions. [2020-01-16 18:04:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:12,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:12,493 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:04:12,493 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:04:12,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:04:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:04:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-01-16 18:04:12,516 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-01-16 18:04:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:12,516 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-01-16 18:04:12,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-01-16 18:04:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:12,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:12,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:12,517 INFO L426 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1158044591, now seen corresponding path program 147 times [2020-01-16 18:04:12,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:12,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732427778] [2020-01-16 18:04:12,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:12,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732427778] [2020-01-16 18:04:12,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:12,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:12,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036972833] [2020-01-16 18:04:12,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:12,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:12,972 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:04:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:13,152 INFO L93 Difference]: Finished difference Result 1407 states and 4949 transitions. [2020-01-16 18:04:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:13,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:13,156 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:04:13,156 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:04:13,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:04:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-01-16 18:04:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:04:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3168 transitions. [2020-01-16 18:04:13,179 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:13,180 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3168 transitions. [2020-01-16 18:04:13,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3168 transitions. [2020-01-16 18:04:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:13,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:13,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] [2020-01-16 18:04:13,181 INFO L426 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -177289873, now seen corresponding path program 148 times [2020-01-16 18:04:13,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:13,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868304588] [2020-01-16 18:04:13,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:13,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868304588] [2020-01-16 18:04:13,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:13,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:13,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594716253] [2020-01-16 18:04:13,644 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:13,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:13,645 INFO L87 Difference]: Start difference. First operand 792 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:13,863 INFO L93 Difference]: Finished difference Result 1406 states and 4944 transitions. [2020-01-16 18:04:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:13,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:13,867 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:04:13,867 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:04:13,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:04:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 789. [2020-01-16 18:04:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-01-16 18:04:13,890 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-01-16 18:04:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:13,890 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-01-16 18:04:13,890 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-01-16 18:04:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:13,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:13,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:13,891 INFO L426 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1775201869, now seen corresponding path program 149 times [2020-01-16 18:04:13,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:13,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624194696] [2020-01-16 18:04:13,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624194696] [2020-01-16 18:04:14,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:14,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:14,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986633594] [2020-01-16 18:04:14,331 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:14,332 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:04:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:14,503 INFO L93 Difference]: Finished difference Result 1411 states and 4954 transitions. [2020-01-16 18:04:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:14,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:14,507 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:04:14,508 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:04:14,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:04:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:04:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:04:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3165 transitions. [2020-01-16 18:04:14,530 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3165 transitions. Word has length 25 [2020-01-16 18:04:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:14,530 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3165 transitions. [2020-01-16 18:04:14,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3165 transitions. [2020-01-16 18:04:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:14,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:14,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:14,532 INFO L426 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -164260911, now seen corresponding path program 150 times [2020-01-16 18:04:14,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:14,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336283703] [2020-01-16 18:04:14,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:14,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336283703] [2020-01-16 18:04:14,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:14,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:14,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581056541] [2020-01-16 18:04:14,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:14,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:14,990 INFO L87 Difference]: Start difference. First operand 792 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:04:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:15,181 INFO L93 Difference]: Finished difference Result 1408 states and 4945 transitions. [2020-01-16 18:04:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:15,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:15,185 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:04:15,185 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:04:15,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:04:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-01-16 18:04:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:04:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3152 transitions. [2020-01-16 18:04:15,206 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3152 transitions. Word has length 25 [2020-01-16 18:04:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:15,206 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3152 transitions. [2020-01-16 18:04:15,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3152 transitions. [2020-01-16 18:04:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:15,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:15,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:15,208 INFO L426 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -56568551, now seen corresponding path program 151 times [2020-01-16 18:04:15,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:15,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442037629] [2020-01-16 18:04:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:15,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442037629] [2020-01-16 18:04:15,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:15,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:15,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915714008] [2020-01-16 18:04:15,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:15,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:15,653 INFO L87 Difference]: Start difference. First operand 786 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:04:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:15,845 INFO L93 Difference]: Finished difference Result 1425 states and 4992 transitions. [2020-01-16 18:04:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:15,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:15,849 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:04:15,849 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:04:15,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:04:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:04:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3177 transitions. [2020-01-16 18:04:15,872 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3177 transitions. Word has length 25 [2020-01-16 18:04:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:15,872 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3177 transitions. [2020-01-16 18:04:15,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3177 transitions. [2020-01-16 18:04:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:15,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:15,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] [2020-01-16 18:04:15,873 INFO L426 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash 913683063, now seen corresponding path program 152 times [2020-01-16 18:04:15,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:15,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963567862] [2020-01-16 18:04:15,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:16,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963567862] [2020-01-16 18:04:16,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:16,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:16,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004959870] [2020-01-16 18:04:16,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:16,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:16,315 INFO L87 Difference]: Start difference. First operand 795 states and 3177 transitions. Second operand 10 states. [2020-01-16 18:04:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:16,475 INFO L93 Difference]: Finished difference Result 1427 states and 4992 transitions. [2020-01-16 18:04:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:16,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:16,479 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:04:16,479 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:04:16,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:04:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-01-16 18:04:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-01-16 18:04:16,501 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-01-16 18:04:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:16,501 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-01-16 18:04:16,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-01-16 18:04:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:16,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:16,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] [2020-01-16 18:04:16,503 INFO L426 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -942366831, now seen corresponding path program 153 times [2020-01-16 18:04:16,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:16,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820526995] [2020-01-16 18:04:16,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:16,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820526995] [2020-01-16 18:04:16,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:16,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:16,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678101455] [2020-01-16 18:04:16,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:16,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:16,975 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:04:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:17,150 INFO L93 Difference]: Finished difference Result 1429 states and 4995 transitions. [2020-01-16 18:04:17,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:17,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:17,153 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:04:17,154 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:04:17,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:04:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 796. [2020-01-16 18:04:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:04:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3175 transitions. [2020-01-16 18:04:17,176 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3175 transitions. Word has length 25 [2020-01-16 18:04:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:17,176 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3175 transitions. [2020-01-16 18:04:17,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3175 transitions. [2020-01-16 18:04:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:17,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:17,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:17,178 INFO L426 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 69897199, now seen corresponding path program 154 times [2020-01-16 18:04:17,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:17,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711012624] [2020-01-16 18:04:17,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:17,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711012624] [2020-01-16 18:04:17,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:17,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:17,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358534025] [2020-01-16 18:04:17,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:17,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:17,652 INFO L87 Difference]: Start difference. First operand 796 states and 3175 transitions. Second operand 10 states. [2020-01-16 18:04:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:17,779 INFO L93 Difference]: Finished difference Result 1434 states and 5000 transitions. [2020-01-16 18:04:17,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:17,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:17,783 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:04:17,783 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:04:17,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:04:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-01-16 18:04:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-01-16 18:04:17,805 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-01-16 18:04:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:17,805 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-01-16 18:04:17,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-01-16 18:04:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:17,807 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:17,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:17,807 INFO L426 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2065870375, now seen corresponding path program 155 times [2020-01-16 18:04:17,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:17,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050064773] [2020-01-16 18:04:17,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:18,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050064773] [2020-01-16 18:04:18,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:18,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:18,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817390433] [2020-01-16 18:04:18,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:18,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:18,243 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:04:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:18,397 INFO L93 Difference]: Finished difference Result 1435 states and 5004 transitions. [2020-01-16 18:04:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:18,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:18,401 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:04:18,401 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:04:18,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:04:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 798. [2020-01-16 18:04:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:04:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3174 transitions. [2020-01-16 18:04:18,425 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3174 transitions. Word has length 25 [2020-01-16 18:04:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:18,425 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3174 transitions. [2020-01-16 18:04:18,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3174 transitions. [2020-01-16 18:04:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:18,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:18,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:18,426 INFO L426 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 82926161, now seen corresponding path program 156 times [2020-01-16 18:04:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:18,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682345433] [2020-01-16 18:04:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:18,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682345433] [2020-01-16 18:04:18,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:18,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:18,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516888002] [2020-01-16 18:04:18,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:18,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:18,884 INFO L87 Difference]: Start difference. First operand 798 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:04:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:19,032 INFO L93 Difference]: Finished difference Result 1438 states and 5003 transitions. [2020-01-16 18:04:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:19,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:19,037 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:04:19,037 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:04:19,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:04:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 786. [2020-01-16 18:04:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:04:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3148 transitions. [2020-01-16 18:04:19,059 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3148 transitions. Word has length 25 [2020-01-16 18:04:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:19,059 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3148 transitions. [2020-01-16 18:04:19,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3148 transitions. [2020-01-16 18:04:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:19,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:19,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] [2020-01-16 18:04:19,060 INFO L426 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1446979801, now seen corresponding path program 157 times [2020-01-16 18:04:19,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:19,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432267298] [2020-01-16 18:04:19,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:19,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-01-16 18:04:19,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432267298] [2020-01-16 18:04:19,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:19,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:19,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841627337] [2020-01-16 18:04:19,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:19,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:19,510 INFO L87 Difference]: Start difference. First operand 786 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:04:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:19,662 INFO L93 Difference]: Finished difference Result 1413 states and 4957 transitions. [2020-01-16 18:04:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:19,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:19,666 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:04:19,666 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:04:19,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:04:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 793. [2020-01-16 18:04:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3167 transitions. [2020-01-16 18:04:19,689 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3167 transitions. Word has length 25 [2020-01-16 18:04:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:19,689 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3167 transitions. [2020-01-16 18:04:19,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3167 transitions. [2020-01-16 18:04:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:19,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:19,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:19,691 INFO L426 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1867232777, now seen corresponding path program 158 times [2020-01-16 18:04:19,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:19,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938732275] [2020-01-16 18:04:19,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:20,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938732275] [2020-01-16 18:04:20,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:20,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:20,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549297516] [2020-01-16 18:04:20,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:20,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:20,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:20,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:20,134 INFO L87 Difference]: Start difference. First operand 793 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:04:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:20,304 INFO L93 Difference]: Finished difference Result 1412 states and 4952 transitions. [2020-01-16 18:04:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:20,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:20,308 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:04:20,308 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:04:20,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:04:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 790. [2020-01-16 18:04:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-01-16 18:04:20,332 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-01-16 18:04:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:20,332 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-01-16 18:04:20,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-01-16 18:04:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:20,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:20,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] [2020-01-16 18:04:20,333 INFO L426 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1364852557, now seen corresponding path program 159 times [2020-01-16 18:04:20,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:20,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163611807] [2020-01-16 18:04:20,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:20,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163611807] [2020-01-16 18:04:20,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:20,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:20,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573985017] [2020-01-16 18:04:20,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:20,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:20,816 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:04:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:20,964 INFO L93 Difference]: Finished difference Result 1421 states and 4970 transitions. [2020-01-16 18:04:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:20,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:20,968 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:04:20,969 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:04:20,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:04:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-01-16 18:04:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-01-16 18:04:20,992 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:20,992 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-01-16 18:04:20,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-01-16 18:04:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:20,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:20,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] [2020-01-16 18:04:20,994 INFO L426 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash -352588527, now seen corresponding path program 160 times [2020-01-16 18:04:20,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:20,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061491457] [2020-01-16 18:04:20,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:21,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-01-16 18:04:21,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061491457] [2020-01-16 18:04:21,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:21,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:21,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268827624] [2020-01-16 18:04:21,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:21,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:21,471 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:21,591 INFO L93 Difference]: Finished difference Result 1426 states and 4975 transitions. [2020-01-16 18:04:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:21,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:21,595 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:04:21,596 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:04:21,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:04:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:04:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:04:21,618 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:04:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:21,618 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:04:21,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:04:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:21,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:21,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:21,619 INFO L426 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash -551818919, now seen corresponding path program 161 times [2020-01-16 18:04:21,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:21,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068609767] [2020-01-16 18:04:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068609767] [2020-01-16 18:04:22,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:22,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:22,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101503155] [2020-01-16 18:04:22,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:22,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:22,080 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:04:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:22,238 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-01-16 18:04:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:22,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:22,242 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:04:22,242 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:04:22,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:04:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:04:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:04:22,264 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:04:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:22,264 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:04:22,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:04:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:22,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:22,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:22,266 INFO L426 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash -13963341, now seen corresponding path program 162 times [2020-01-16 18:04:22,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:22,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831624654] [2020-01-16 18:04:22,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:22,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831624654] [2020-01-16 18:04:22,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:22,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:22,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590334808] [2020-01-16 18:04:22,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:22,736 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:04:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:22,889 INFO L93 Difference]: Finished difference Result 1424 states and 4967 transitions. [2020-01-16 18:04:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:22,893 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:04:22,894 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:04:22,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:04:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-01-16 18:04:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:04:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3144 transitions. [2020-01-16 18:04:22,916 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3144 transitions. Word has length 25 [2020-01-16 18:04:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:22,916 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3144 transitions. [2020-01-16 18:04:22,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3144 transitions. [2020-01-16 18:04:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:22,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:22,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] [2020-01-16 18:04:22,917 INFO L426 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 347922065, now seen corresponding path program 163 times [2020-01-16 18:04:22,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:22,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320042790] [2020-01-16 18:04:22,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:23,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320042790] [2020-01-16 18:04:23,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:23,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:23,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689065241] [2020-01-16 18:04:23,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:23,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:23,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:23,375 INFO L87 Difference]: Start difference. First operand 786 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:04:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:23,545 INFO L93 Difference]: Finished difference Result 1421 states and 4971 transitions. [2020-01-16 18:04:23,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:23,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:23,550 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:04:23,550 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:04:23,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:04:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 793. [2020-01-16 18:04:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3163 transitions. [2020-01-16 18:04:23,573 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3163 transitions. Word has length 25 [2020-01-16 18:04:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:23,573 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3163 transitions. [2020-01-16 18:04:23,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3163 transitions. [2020-01-16 18:04:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:23,574 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:23,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:23,574 INFO L426 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1958863023, now seen corresponding path program 164 times [2020-01-16 18:04:23,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:23,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183416744] [2020-01-16 18:04:23,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:24,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183416744] [2020-01-16 18:04:24,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:24,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:24,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804856181] [2020-01-16 18:04:24,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:24,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:24,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:24,037 INFO L87 Difference]: Start difference. First operand 793 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:04:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:24,199 INFO L93 Difference]: Finished difference Result 1418 states and 4962 transitions. [2020-01-16 18:04:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:24,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:24,203 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:04:24,203 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:04:24,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:04:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:04:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:04:24,224 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:04:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:24,224 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:04:24,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:04:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:24,226 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:24,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:24,226 INFO L426 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash -158424201, now seen corresponding path program 165 times [2020-01-16 18:04:24,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:24,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877027414] [2020-01-16 18:04:24,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:24,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877027414] [2020-01-16 18:04:24,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:24,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:24,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257438422] [2020-01-16 18:04:24,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:24,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:24,738 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:04:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:24,887 INFO L93 Difference]: Finished difference Result 1431 states and 4990 transitions. [2020-01-16 18:04:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:24,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:24,892 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:04:24,892 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:04:24,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:04:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-01-16 18:04:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:04:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:04:24,914 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:24,914 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:04:24,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:04:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:24,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:24,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:24,916 INFO L426 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1990372335, now seen corresponding path program 166 times [2020-01-16 18:04:24,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:24,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296555101] [2020-01-16 18:04:24,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:25,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296555101] [2020-01-16 18:04:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:25,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716998358] [2020-01-16 18:04:25,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:25,382 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:25,499 INFO L93 Difference]: Finished difference Result 1434 states and 4989 transitions. [2020-01-16 18:04:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:25,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:25,504 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:04:25,504 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:04:25,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:04:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-01-16 18:04:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3151 transitions. [2020-01-16 18:04:25,526 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3151 transitions. Word has length 25 [2020-01-16 18:04:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:25,526 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3151 transitions. [2020-01-16 18:04:25,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3151 transitions. [2020-01-16 18:04:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:25,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:25,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:25,528 INFO L426 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash -147921097, now seen corresponding path program 167 times [2020-01-16 18:04:25,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:25,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109302662] [2020-01-16 18:04:25,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:25,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109302662] [2020-01-16 18:04:25,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:25,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:25,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501550188] [2020-01-16 18:04:25,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:25,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:25,997 INFO L87 Difference]: Start difference. First operand 790 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:04:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:26,146 INFO L93 Difference]: Finished difference Result 1422 states and 4965 transitions. [2020-01-16 18:04:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:26,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:26,150 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:04:26,150 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:04:26,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:04:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-01-16 18:04:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-01-16 18:04:26,173 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-01-16 18:04:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:26,173 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-01-16 18:04:26,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-01-16 18:04:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:26,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:26,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:26,175 INFO L426 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 389934481, now seen corresponding path program 168 times [2020-01-16 18:04:26,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:26,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474106137] [2020-01-16 18:04:26,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:26,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474106137] [2020-01-16 18:04:26,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:26,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:26,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090317616] [2020-01-16 18:04:26,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:26,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:26,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:26,642 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:04:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:26,767 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:04:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:26,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:26,771 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:04:26,771 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:04:26,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:04:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 782. [2020-01-16 18:04:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:04:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-01-16 18:04:26,796 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-01-16 18:04:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:26,796 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-01-16 18:04:26,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-01-16 18:04:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:26,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:26,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:26,797 INFO L426 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 576247283, now seen corresponding path program 169 times [2020-01-16 18:04:26,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:26,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271145737] [2020-01-16 18:04:26,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:27,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-01-16 18:04:27,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271145737] [2020-01-16 18:04:27,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:27,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:27,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258640901] [2020-01-16 18:04:27,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:27,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:27,270 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:04:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:27,419 INFO L93 Difference]: Finished difference Result 1444 states and 5049 transitions. [2020-01-16 18:04:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:27,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:27,423 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:04:27,423 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:04:27,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:04:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 797. [2020-01-16 18:04:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:04:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3183 transitions. [2020-01-16 18:04:27,446 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3183 transitions. Word has length 25 [2020-01-16 18:04:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:27,446 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3183 transitions. [2020-01-16 18:04:27,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3183 transitions. [2020-01-16 18:04:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:27,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:27,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:27,447 INFO L426 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1546498897, now seen corresponding path program 170 times [2020-01-16 18:04:27,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:27,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829965609] [2020-01-16 18:04:27,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04: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-01-16 18:04:27,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829965609] [2020-01-16 18:04:27,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:27,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747853870] [2020-01-16 18:04:27,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:27,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:27,898 INFO L87 Difference]: Start difference. First operand 797 states and 3183 transitions. Second operand 10 states. [2020-01-16 18:04:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:28,083 INFO L93 Difference]: Finished difference Result 1446 states and 5049 transitions. [2020-01-16 18:04:28,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:28,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:28,087 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:04:28,087 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:04:28,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:04:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-01-16 18:04:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3172 transitions. [2020-01-16 18:04:28,109 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3172 transitions. Word has length 25 [2020-01-16 18:04:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:28,109 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3172 transitions. [2020-01-16 18:04:28,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3172 transitions. [2020-01-16 18:04:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:28,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:28,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:28,111 INFO L426 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash 133348143, now seen corresponding path program 171 times [2020-01-16 18:04:28,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:28,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094811662] [2020-01-16 18:04:28,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:28,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094811662] [2020-01-16 18:04:28,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:28,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:28,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205935384] [2020-01-16 18:04:28,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:28,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:28,559 INFO L87 Difference]: Start difference. First operand 793 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:04:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:28,702 INFO L93 Difference]: Finished difference Result 1445 states and 5047 transitions. [2020-01-16 18:04:28,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:28,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:28,707 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:04:28,707 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:04:28,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:04:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 797. [2020-01-16 18:04:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:04:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3179 transitions. [2020-01-16 18:04:28,730 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3179 transitions. Word has length 25 [2020-01-16 18:04:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:28,731 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3179 transitions. [2020-01-16 18:04:28,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3179 transitions. [2020-01-16 18:04:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:28,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:28,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] [2020-01-16 18:04:28,732 INFO L426 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1124605965, now seen corresponding path program 172 times [2020-01-16 18:04:28,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:28,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753109274] [2020-01-16 18:04:28,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:29,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753109274] [2020-01-16 18:04:29,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:29,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:29,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758878768] [2020-01-16 18:04:29,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:29,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:29,180 INFO L87 Difference]: Start difference. First operand 797 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:04:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:29,351 INFO L93 Difference]: Finished difference Result 1448 states and 5049 transitions. [2020-01-16 18:04:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:29,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:29,355 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:04:29,355 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:04:29,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:04:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-01-16 18:04:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3168 transitions. [2020-01-16 18:04:29,377 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:29,377 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3168 transitions. [2020-01-16 18:04:29,377 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3168 transitions. [2020-01-16 18:04:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:29,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:29,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] [2020-01-16 18:04:29,378 INFO L426 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2084246989, now seen corresponding path program 173 times [2020-01-16 18:04:29,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:29,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897767010] [2020-01-16 18:04:29,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:29,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897767010] [2020-01-16 18:04:29,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:29,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:29,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360554740] [2020-01-16 18:04:29,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:29,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:29,827 INFO L87 Difference]: Start difference. First operand 793 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:29,968 INFO L93 Difference]: Finished difference Result 1451 states and 5057 transitions. [2020-01-16 18:04:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:29,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:29,972 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:04:29,973 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:04:29,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:04:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-01-16 18:04:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:04:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-01-16 18:04:29,995 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-01-16 18:04:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:29,995 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-01-16 18:04:29,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-01-16 18:04:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:29,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:29,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:29,997 INFO L426 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1137634927, now seen corresponding path program 174 times [2020-01-16 18:04:29,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:29,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120522814] [2020-01-16 18:04:29,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:30,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120522814] [2020-01-16 18:04:30,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:30,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:30,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145264833] [2020-01-16 18:04:30,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:30,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:30,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:30,457 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:04:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:30,608 INFO L93 Difference]: Finished difference Result 1452 states and 5053 transitions. [2020-01-16 18:04:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:30,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:30,612 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:04:30,612 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:04:30,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:04:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 789. [2020-01-16 18:04:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3157 transitions. [2020-01-16 18:04:30,634 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3157 transitions. Word has length 25 [2020-01-16 18:04:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:30,634 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3157 transitions. [2020-01-16 18:04:30,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3157 transitions. [2020-01-16 18:04:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:30,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:30,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] [2020-01-16 18:04:30,635 INFO L426 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:30,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash -268724169, now seen corresponding path program 175 times [2020-01-16 18:04:30,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:30,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505126955] [2020-01-16 18:04:30,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:31,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505126955] [2020-01-16 18:04:31,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:31,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:31,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666932127] [2020-01-16 18:04:31,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:31,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:31,094 INFO L87 Difference]: Start difference. First operand 789 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:04:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:31,247 INFO L93 Difference]: Finished difference Result 1449 states and 5055 transitions. [2020-01-16 18:04:31,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:31,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:31,251 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:04:31,251 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:04:31,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:04:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-01-16 18:04:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:04:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3182 transitions. [2020-01-16 18:04:31,273 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3182 transitions. Word has length 25 [2020-01-16 18:04:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:31,274 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3182 transitions. [2020-01-16 18:04:31,274 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3182 transitions. [2020-01-16 18:04:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:31,275 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:31,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] [2020-01-16 18:04:31,275 INFO L426 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 701527445, now seen corresponding path program 176 times [2020-01-16 18:04:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:31,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978334737] [2020-01-16 18:04:31,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:31,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-01-16 18:04:31,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978334737] [2020-01-16 18:04:31,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:31,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:31,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080288144] [2020-01-16 18:04:31,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:31,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:31,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:31,729 INFO L87 Difference]: Start difference. First operand 798 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:04:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:31,892 INFO L93 Difference]: Finished difference Result 1451 states and 5055 transitions. [2020-01-16 18:04:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:31,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:31,896 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:04:31,896 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:04:31,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:04:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-01-16 18:04:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3171 transitions. [2020-01-16 18:04:31,919 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3171 transitions. Word has length 25 [2020-01-16 18:04:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:31,919 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3171 transitions. [2020-01-16 18:04:31,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3171 transitions. [2020-01-16 18:04:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:31,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:31,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:31,920 INFO L426 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1154522449, now seen corresponding path program 177 times [2020-01-16 18:04:31,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:31,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441623164] [2020-01-16 18:04:31,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441623164] [2020-01-16 18:04:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:32,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761263223] [2020-01-16 18:04:32,550 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:32,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:32,551 INFO L87 Difference]: Start difference. First operand 794 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:04:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:32,704 INFO L93 Difference]: Finished difference Result 1453 states and 5058 transitions. [2020-01-16 18:04:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:32,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:32,708 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:04:32,708 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:04:32,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:04:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 799. [2020-01-16 18:04:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:04:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3180 transitions. [2020-01-16 18:04:32,731 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3180 transitions. Word has length 25 [2020-01-16 18:04:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:32,731 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3180 transitions. [2020-01-16 18:04:32,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3180 transitions. [2020-01-16 18:04:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:32,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:32,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] [2020-01-16 18:04:32,732 INFO L426 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -142258419, now seen corresponding path program 178 times [2020-01-16 18:04:32,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:32,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815116657] [2020-01-16 18:04:32,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:33,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815116657] [2020-01-16 18:04:33,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:33,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:33,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102092128] [2020-01-16 18:04:33,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:33,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:33,206 INFO L87 Difference]: Start difference. First operand 799 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:04:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:33,334 INFO L93 Difference]: Finished difference Result 1458 states and 5063 transitions. [2020-01-16 18:04:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:33,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:33,338 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:04:33,338 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:04:33,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:04:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 794. [2020-01-16 18:04:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3166 transitions. [2020-01-16 18:04:33,360 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3166 transitions. Word has length 25 [2020-01-16 18:04:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:33,360 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3166 transitions. [2020-01-16 18:04:33,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3166 transitions. [2020-01-16 18:04:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:33,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:33,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:33,362 INFO L426 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2016941303, now seen corresponding path program 179 times [2020-01-16 18:04:33,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:33,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285352404] [2020-01-16 18:04:33,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:33,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285352404] [2020-01-16 18:04:33,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:33,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:33,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284367346] [2020-01-16 18:04:33,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:33,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:33,823 INFO L87 Difference]: Start difference. First operand 794 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:04:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:34,020 INFO L93 Difference]: Finished difference Result 1459 states and 5067 transitions. [2020-01-16 18:04:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:34,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:34,024 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:04:34,024 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:04:34,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:04:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 801. [2020-01-16 18:04:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:04:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3179 transitions. [2020-01-16 18:04:34,047 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3179 transitions. Word has length 25 [2020-01-16 18:04:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:34,047 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3179 transitions. [2020-01-16 18:04:34,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3179 transitions. [2020-01-16 18:04:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:34,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:34,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] [2020-01-16 18:04:34,048 INFO L426 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -129229457, now seen corresponding path program 180 times [2020-01-16 18:04:34,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:34,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714176613] [2020-01-16 18:04:34,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:34,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714176613] [2020-01-16 18:04:34,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:34,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:34,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893842143] [2020-01-16 18:04:34,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:34,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:34,517 INFO L87 Difference]: Start difference. First operand 801 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:04:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:34,671 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-01-16 18:04:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:34,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:34,676 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:04:34,676 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:04:34,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:04:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-01-16 18:04:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3152 transitions. [2020-01-16 18:04:34,698 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3152 transitions. Word has length 25 [2020-01-16 18:04:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:34,698 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3152 transitions. [2020-01-16 18:04:34,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3152 transitions. [2020-01-16 18:04:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:34,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:34,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:34,700 INFO L426 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1556594761, now seen corresponding path program 181 times [2020-01-16 18:04:34,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:34,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208320594] [2020-01-16 18:04:34,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:35,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208320594] [2020-01-16 18:04:35,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:35,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:35,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529903475] [2020-01-16 18:04:35,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:35,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:35,164 INFO L87 Difference]: Start difference. First operand 789 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:04:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:35,319 INFO L93 Difference]: Finished difference Result 1454 states and 5060 transitions. [2020-01-16 18:04:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:35,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:35,323 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:04:35,323 INFO L226 Difference]: Without dead ends: 1441 [2020-01-16 18:04:35,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-01-16 18:04:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 799. [2020-01-16 18:04:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:04:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-01-16 18:04:35,347 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-01-16 18:04:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:35,348 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-01-16 18:04:35,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-01-16 18:04:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:35,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:35,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:35,350 INFO L426 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash -565336939, now seen corresponding path program 182 times [2020-01-16 18:04:35,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:35,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578570181] [2020-01-16 18:04:35,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:35,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578570181] [2020-01-16 18:04:35,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:35,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:35,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542984729] [2020-01-16 18:04:35,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:35,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:35,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:35,819 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:04:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:36,004 INFO L93 Difference]: Finished difference Result 1457 states and 5062 transitions. [2020-01-16 18:04:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:36,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:36,011 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:04:36,012 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:04:36,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:04:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 795. [2020-01-16 18:04:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-01-16 18:04:36,044 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:36,044 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-01-16 18:04:36,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-01-16 18:04:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:36,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:36,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:36,046 INFO L426 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1999493901, now seen corresponding path program 183 times [2020-01-16 18:04:36,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:36,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124516108] [2020-01-16 18:04:36,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:36,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124516108] [2020-01-16 18:04:36,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:36,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:36,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100956008] [2020-01-16 18:04:36,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:36,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:36,526 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:36,679 INFO L93 Difference]: Finished difference Result 1457 states and 5061 transitions. [2020-01-16 18:04:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:36,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:36,683 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:04:36,683 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:04:36,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:04:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 800. [2020-01-16 18:04:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:04:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3177 transitions. [2020-01-16 18:04:36,706 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3177 transitions. Word has length 25 [2020-01-16 18:04:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:36,706 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3177 transitions. [2020-01-16 18:04:36,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3177 transitions. [2020-01-16 18:04:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:36,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:36,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:36,707 INFO L426 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash -987229871, now seen corresponding path program 184 times [2020-01-16 18:04:36,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:36,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705285252] [2020-01-16 18:04:36,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:37,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-01-16 18:04:37,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705285252] [2020-01-16 18:04:37,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:37,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:37,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272198789] [2020-01-16 18:04:37,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:37,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:37,210 INFO L87 Difference]: Start difference. First operand 800 states and 3177 transitions. Second operand 10 states. [2020-01-16 18:04:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:37,340 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-01-16 18:04:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:37,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:37,344 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:04:37,344 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:04:37,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:04:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 795. [2020-01-16 18:04:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3163 transitions. [2020-01-16 18:04:37,367 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3163 transitions. Word has length 25 [2020-01-16 18:04:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:37,367 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3163 transitions. [2020-01-16 18:04:37,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3163 transitions. [2020-01-16 18:04:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:37,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:37,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:37,369 INFO L426 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 750076919, now seen corresponding path program 185 times [2020-01-16 18:04:37,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:37,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309456688] [2020-01-16 18:04:37,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:37,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309456688] [2020-01-16 18:04:37,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:37,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:37,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213394167] [2020-01-16 18:04:37,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:37,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:37,840 INFO L87 Difference]: Start difference. First operand 795 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:04:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:37,996 INFO L93 Difference]: Finished difference Result 1467 states and 5078 transitions. [2020-01-16 18:04:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:37,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:38,000 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:04:38,000 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:04:38,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:04:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-01-16 18:04:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:04:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3179 transitions. [2020-01-16 18:04:38,024 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3179 transitions. Word has length 25 [2020-01-16 18:04:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:38,025 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3179 transitions. [2020-01-16 18:04:38,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3179 transitions. [2020-01-16 18:04:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:38,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:38,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] [2020-01-16 18:04:38,027 INFO L426 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -323008461, now seen corresponding path program 186 times [2020-01-16 18:04:38,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:38,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181950422] [2020-01-16 18:04:38,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:38,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181950422] [2020-01-16 18:04:38,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:38,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:38,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407990144] [2020-01-16 18:04:38,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:38,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:38,503 INFO L87 Difference]: Start difference. First operand 804 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:04:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:38,631 INFO L93 Difference]: Finished difference Result 1469 states and 5074 transitions. [2020-01-16 18:04:38,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:38,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:38,635 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:04:38,635 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:04:38,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:04:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 789. [2020-01-16 18:04:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:04:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-01-16 18:04:38,657 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-01-16 18:04:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:38,657 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-01-16 18:04:38,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-01-16 18:04:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:38,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:38,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:38,659 INFO L426 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 38876945, now seen corresponding path program 187 times [2020-01-16 18:04:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619120464] [2020-01-16 18:04:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:39,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619120464] [2020-01-16 18:04:39,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:39,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:39,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472261197] [2020-01-16 18:04:39,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:39,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:39,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:39,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:39,133 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:04:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:39,311 INFO L93 Difference]: Finished difference Result 1469 states and 5093 transitions. [2020-01-16 18:04:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:39,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:39,315 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:04:39,315 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:04:39,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:04:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 804. [2020-01-16 18:04:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:04:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3186 transitions. [2020-01-16 18:04:39,338 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3186 transitions. Word has length 25 [2020-01-16 18:04:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:39,338 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3186 transitions. [2020-01-16 18:04:39,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3186 transitions. [2020-01-16 18:04:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:39,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:39,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:39,339 INFO L426 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1034208435, now seen corresponding path program 188 times [2020-01-16 18:04:39,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:39,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500404768] [2020-01-16 18:04:39,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:39,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500404768] [2020-01-16 18:04:39,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:39,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:39,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085756197] [2020-01-16 18:04:39,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:39,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:39,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:39,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:39,825 INFO L87 Difference]: Start difference. First operand 804 states and 3186 transitions. Second operand 10 states. [2020-01-16 18:04:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:40,015 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-01-16 18:04:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:40,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:40,020 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:04:40,020 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:04:40,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:04:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 798. [2020-01-16 18:04:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:04:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-01-16 18:04:40,046 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-01-16 18:04:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:40,046 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-01-16 18:04:40,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-01-16 18:04:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:40,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:40,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] [2020-01-16 18:04:40,048 INFO L426 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1132968533, now seen corresponding path program 189 times [2020-01-16 18:04:40,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:40,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023391523] [2020-01-16 18:04:40,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:40,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-01-16 18:04:40,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023391523] [2020-01-16 18:04:40,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:40,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:40,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237547943] [2020-01-16 18:04:40,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:40,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:40,518 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:04:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:40,669 INFO L93 Difference]: Finished difference Result 1472 states and 5092 transitions. [2020-01-16 18:04:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:40,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:40,674 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:04:40,674 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:04:40,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:04:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 805. [2020-01-16 18:04:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:04:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3182 transitions. [2020-01-16 18:04:40,696 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3182 transitions. Word has length 25 [2020-01-16 18:04:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:40,696 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3182 transitions. [2020-01-16 18:04:40,696 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3182 transitions. [2020-01-16 18:04:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:40,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:40,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:40,697 INFO L426 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1013202227, now seen corresponding path program 190 times [2020-01-16 18:04:40,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:40,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688533501] [2020-01-16 18:04:40,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:41,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688533501] [2020-01-16 18:04:41,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:41,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:41,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651757527] [2020-01-16 18:04:41,172 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:41,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:41,173 INFO L87 Difference]: Start difference. First operand 805 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:04:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:41,297 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-01-16 18:04:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:41,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:41,301 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:04:41,301 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:04:41,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:04:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-01-16 18:04:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:04:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3162 transitions. [2020-01-16 18:04:41,324 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3162 transitions. Word has length 25 [2020-01-16 18:04:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:41,324 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3162 transitions. [2020-01-16 18:04:41,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3162 transitions. [2020-01-16 18:04:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:41,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:41,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:41,325 INFO L426 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:41,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1153974741, now seen corresponding path program 191 times [2020-01-16 18:04:41,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:41,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116758597] [2020-01-16 18:04:41,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:41,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-01-16 18:04:41,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116758597] [2020-01-16 18:04:41,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:41,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:41,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663958261] [2020-01-16 18:04:41,797 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:41,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:41,797 INFO L87 Difference]: Start difference. First operand 798 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:04:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:41,953 INFO L93 Difference]: Finished difference Result 1476 states and 5093 transitions. [2020-01-16 18:04:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:41,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:41,957 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:04:41,957 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:04:41,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:04:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 807. [2020-01-16 18:04:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:04:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3178 transitions. [2020-01-16 18:04:41,979 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3178 transitions. Word has length 25 [2020-01-16 18:04:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:41,979 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3178 transitions. [2020-01-16 18:04:41,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3178 transitions. [2020-01-16 18:04:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:41,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:41,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] [2020-01-16 18:04:41,980 INFO L426 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 80889361, now seen corresponding path program 192 times [2020-01-16 18:04:41,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:41,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109833835] [2020-01-16 18:04:41,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:42,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-01-16 18:04:42,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109833835] [2020-01-16 18:04:42,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:42,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:42,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063360997] [2020-01-16 18:04:42,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:42,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:42,471 INFO L87 Difference]: Start difference. First operand 807 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:04:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:42,596 INFO L93 Difference]: Finished difference Result 1478 states and 5089 transitions. [2020-01-16 18:04:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:42,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:42,600 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:04:42,600 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:04:42,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:04:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 782. [2020-01-16 18:04:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:04:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:04:42,624 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:04:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:42,624 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:04:42,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:04:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:42,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:42,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] [2020-01-16 18:04:42,626 INFO L426 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1867640017, now seen corresponding path program 193 times [2020-01-16 18:04:42,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:42,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836062363] [2020-01-16 18:04:42,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:43,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836062363] [2020-01-16 18:04:43,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:43,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:43,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692396924] [2020-01-16 18:04:43,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:43,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:43,090 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:04:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:43,253 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-01-16 18:04:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:43,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:43,257 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:04:43,257 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:04:43,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:04:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 793. [2020-01-16 18:04:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-01-16 18:04:43,280 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-01-16 18:04:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:43,280 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-01-16 18:04:43,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-01-16 18:04:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:43,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:43,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:43,281 INFO L426 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1446572561, now seen corresponding path program 194 times [2020-01-16 18:04:43,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:43,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763622075] [2020-01-16 18:04:43,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:43,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763622075] [2020-01-16 18:04:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:43,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660050430] [2020-01-16 18:04:43,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:43,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:43,751 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:04:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:43,902 INFO L93 Difference]: Finished difference Result 1413 states and 4952 transitions. [2020-01-16 18:04:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:43,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:43,906 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:04:43,906 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:04:43,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:04:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 790. [2020-01-16 18:04:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3156 transitions. [2020-01-16 18:04:43,927 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3156 transitions. Word has length 25 [2020-01-16 18:04:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:43,928 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3156 transitions. [2020-01-16 18:04:43,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3156 transitions. [2020-01-16 18:04:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:43,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:43,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:43,929 INFO L426 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash -501293201, now seen corresponding path program 195 times [2020-01-16 18:04:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062801746] [2020-01-16 18:04:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062801746] [2020-01-16 18:04:44,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:44,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003921853] [2020-01-16 18:04:44,384 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:44,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:44,384 INFO L87 Difference]: Start difference. First operand 790 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:04:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:44,534 INFO L93 Difference]: Finished difference Result 1419 states and 4965 transitions. [2020-01-16 18:04:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:44,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:44,538 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:04:44,538 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:04:44,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:04:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:04:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3163 transitions. [2020-01-16 18:04:44,560 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3163 transitions. Word has length 25 [2020-01-16 18:04:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:44,560 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3163 transitions. [2020-01-16 18:04:44,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3163 transitions. [2020-01-16 18:04:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:44,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:44,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:44,562 INFO L426 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 489964621, now seen corresponding path program 196 times [2020-01-16 18:04:44,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:44,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711832773] [2020-01-16 18:04:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:45,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711832773] [2020-01-16 18:04:45,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:45,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:45,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371990555] [2020-01-16 18:04:45,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:45,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:45,009 INFO L87 Difference]: Start difference. First operand 794 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:04:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:45,192 INFO L93 Difference]: Finished difference Result 1422 states and 4967 transitions. [2020-01-16 18:04:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:45,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:45,197 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:04:45,197 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:04:45,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:04:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:04:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:04:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-01-16 18:04:45,219 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-01-16 18:04:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:45,219 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-01-16 18:04:45,219 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-01-16 18:04:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:45,220 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:45,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:45,220 INFO L426 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash -782351151, now seen corresponding path program 197 times [2020-01-16 18:04:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:45,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286145123] [2020-01-16 18:04:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:45,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286145123] [2020-01-16 18:04:45,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:45,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:45,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590200427] [2020-01-16 18:04:45,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:45,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:45,676 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:04:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:45,828 INFO L93 Difference]: Finished difference Result 1416 states and 4955 transitions. [2020-01-16 18:04:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:45,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:45,832 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:04:45,832 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:04:45,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:04:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 793. [2020-01-16 18:04:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3158 transitions. [2020-01-16 18:04:45,856 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3158 transitions. Word has length 25 [2020-01-16 18:04:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:45,856 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3158 transitions. [2020-01-16 18:04:45,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3158 transitions. [2020-01-16 18:04:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:45,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:45,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:45,857 INFO L426 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash 828589807, now seen corresponding path program 198 times [2020-01-16 18:04:45,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:45,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935204551] [2020-01-16 18:04:45,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:46,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-01-16 18:04:46,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935204551] [2020-01-16 18:04:46,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:46,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979757469] [2020-01-16 18:04:46,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:46,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:46,309 INFO L87 Difference]: Start difference. First operand 793 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:04:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:46,464 INFO L93 Difference]: Finished difference Result 1420 states and 4960 transitions. [2020-01-16 18:04:46,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:46,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:46,468 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:04:46,468 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:04:46,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:04:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 787. [2020-01-16 18:04:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:04:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-01-16 18:04:46,491 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-01-16 18:04:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:46,491 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-01-16 18:04:46,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-01-16 18:04:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:46,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:46,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:46,492 INFO L426 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1022668565, now seen corresponding path program 199 times [2020-01-16 18:04:46,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:46,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55167238] [2020-01-16 18:04:46,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:46,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-01-16 18:04:46,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55167238] [2020-01-16 18:04:46,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:46,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:46,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036585583] [2020-01-16 18:04:46,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:46,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:46,951 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:04:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:47,110 INFO L93 Difference]: Finished difference Result 1419 states and 4964 transitions. [2020-01-16 18:04:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:47,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:47,113 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:04:47,114 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:04:47,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:04:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:04:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:04:47,135 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:04:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:47,136 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:04:47,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:04:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:47,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:47,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:47,137 INFO L426 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2003423283, now seen corresponding path program 200 times [2020-01-16 18:04:47,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:47,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541658724] [2020-01-16 18:04:47,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:47,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541658724] [2020-01-16 18:04:47,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:47,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:47,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366987650] [2020-01-16 18:04:47,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:47,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:47,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:47,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:47,625 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:04:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:47,782 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-01-16 18:04:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:47,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:47,786 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:04:47,787 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:04:47,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:04:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 791. [2020-01-16 18:04:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-01-16 18:04:47,810 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-01-16 18:04:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:47,810 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-01-16 18:04:47,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-01-16 18:04:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:47,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:47,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:47,812 INFO L426 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1789163793, now seen corresponding path program 201 times [2020-01-16 18:04:47,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:47,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061169386] [2020-01-16 18:04:47,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:48,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061169386] [2020-01-16 18:04:48,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:48,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:48,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130897691] [2020-01-16 18:04:48,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:48,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:48,266 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:04:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:48,421 INFO L93 Difference]: Finished difference Result 1427 states and 4977 transitions. [2020-01-16 18:04:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:48,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:48,425 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:04:48,426 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:04:48,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:04:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-01-16 18:04:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:04:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3165 transitions. [2020-01-16 18:04:48,448 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3165 transitions. Word has length 25 [2020-01-16 18:04:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:48,449 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3165 transitions. [2020-01-16 18:04:48,449 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3165 transitions. [2020-01-16 18:04:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:48,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:48,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:48,450 INFO L426 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash -776899763, now seen corresponding path program 202 times [2020-01-16 18:04:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:48,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255379898] [2020-01-16 18:04:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:48,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-01-16 18:04:48,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255379898] [2020-01-16 18:04:48,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:48,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:48,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386815393] [2020-01-16 18:04:48,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:48,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:48,914 INFO L87 Difference]: Start difference. First operand 796 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:04:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:49,071 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-01-16 18:04:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:49,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:49,075 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:04:49,075 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:04:49,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:04:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 791. [2020-01-16 18:04:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-01-16 18:04:49,097 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-01-16 18:04:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:49,097 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-01-16 18:04:49,097 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-01-16 18:04:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:49,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:49,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:49,098 INFO L426 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash -976130155, now seen corresponding path program 203 times [2020-01-16 18:04:49,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:49,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359524228] [2020-01-16 18:04:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:49,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359524228] [2020-01-16 18:04:49,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:49,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:49,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993114264] [2020-01-16 18:04:49,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:49,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:49,555 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:04:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:49,746 INFO L93 Difference]: Finished difference Result 1424 states and 4966 transitions. [2020-01-16 18:04:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:49,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:49,751 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:04:49,751 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:04:49,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:04:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:04:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3159 transitions. [2020-01-16 18:04:49,780 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3159 transitions. Word has length 25 [2020-01-16 18:04:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:49,781 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3159 transitions. [2020-01-16 18:04:49,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3159 transitions. [2020-01-16 18:04:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:49,782 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:49,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] [2020-01-16 18:04:49,782 INFO L426 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash -438274577, now seen corresponding path program 204 times [2020-01-16 18:04:49,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:49,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884418567] [2020-01-16 18:04:49,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:50,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884418567] [2020-01-16 18:04:50,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:50,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:50,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995293632] [2020-01-16 18:04:50,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:50,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:50,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:50,246 INFO L87 Difference]: Start difference. First operand 795 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:04:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:50,378 INFO L93 Difference]: Finished difference Result 1430 states and 4974 transitions. [2020-01-16 18:04:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:50,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:50,382 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:04:50,382 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:04:50,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:04:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 787. [2020-01-16 18:04:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:04:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:04:50,406 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:04:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:50,406 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:04:50,406 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:04:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:50,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:50,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:50,407 INFO L426 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1768750379, now seen corresponding path program 205 times [2020-01-16 18:04:50,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:50,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689828378] [2020-01-16 18:04:50,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:50,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689828378] [2020-01-16 18:04:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:50,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:50,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984471059] [2020-01-16 18:04:50,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:50,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:50,896 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:04:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:51,047 INFO L93 Difference]: Finished difference Result 1436 states and 5001 transitions. [2020-01-16 18:04:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:51,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:51,051 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:04:51,052 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:04:51,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:04:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 797. [2020-01-16 18:04:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:04:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:04:51,074 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:51,074 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:04:51,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:04:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:51,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:51,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:51,075 INFO L426 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -777492557, now seen corresponding path program 206 times [2020-01-16 18:04:51,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:51,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644223452] [2020-01-16 18:04:51,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:51,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644223452] [2020-01-16 18:04:51,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:51,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:51,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916458083] [2020-01-16 18:04:51,550 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:51,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:51,550 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:51,708 INFO L93 Difference]: Finished difference Result 1439 states and 5003 transitions. [2020-01-16 18:04:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:51,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:51,713 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:04:51,713 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:04:51,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:04:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 793. [2020-01-16 18:04:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:04:51,736 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:04:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:51,736 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:04:51,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:04:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:51,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:51,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:51,737 INFO L426 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2083317777, now seen corresponding path program 207 times [2020-01-16 18:04:51,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:51,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316070352] [2020-01-16 18:04:51,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:52,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316070352] [2020-01-16 18:04:52,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:52,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:52,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407650548] [2020-01-16 18:04:52,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:52,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:52,204 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:04:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:52,359 INFO L93 Difference]: Finished difference Result 1439 states and 5002 transitions. [2020-01-16 18:04:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:52,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:52,363 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:04:52,364 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:04:52,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:04:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-01-16 18:04:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:04:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-01-16 18:04:52,386 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-01-16 18:04:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:52,386 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-01-16 18:04:52,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-01-16 18:04:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:52,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:52,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:52,387 INFO L426 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1199385489, now seen corresponding path program 208 times [2020-01-16 18:04:52,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:52,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566783228] [2020-01-16 18:04:52,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:52,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566783228] [2020-01-16 18:04:52,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:52,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:52,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795092949] [2020-01-16 18:04:52,848 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:52,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:52,849 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:04:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:53,014 INFO L93 Difference]: Finished difference Result 1444 states and 5007 transitions. [2020-01-16 18:04:53,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:53,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:53,019 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:04:53,019 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:04:53,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:04:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 793. [2020-01-16 18:04:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:04:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:04:53,045 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:04:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:53,045 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:04:53,045 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:04:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:53,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:53,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:53,047 INFO L426 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash 537921301, now seen corresponding path program 209 times [2020-01-16 18:04:53,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:53,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710801992] [2020-01-16 18:04:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:53,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710801992] [2020-01-16 18:04:53,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:53,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:53,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520392535] [2020-01-16 18:04:53,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:53,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:53,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:53,513 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:04:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:53,704 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-01-16 18:04:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:53,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:53,708 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:04:53,708 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:04:53,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:04:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-01-16 18:04:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:04:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3168 transitions. [2020-01-16 18:04:53,732 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3168 transitions. Word has length 25 [2020-01-16 18:04:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:53,732 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3168 transitions. [2020-01-16 18:04:53,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3168 transitions. [2020-01-16 18:04:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:53,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:53,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:53,734 INFO L426 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:53,734 INFO L82 PathProgramCache]: Analyzing trace with hash -535164079, now seen corresponding path program 210 times [2020-01-16 18:04:53,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:53,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807112617] [2020-01-16 18:04:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:54,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807112617] [2020-01-16 18:04:54,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:54,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:54,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335533560] [2020-01-16 18:04:54,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:54,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:54,209 INFO L87 Difference]: Start difference. First operand 802 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:04:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:54,364 INFO L93 Difference]: Finished difference Result 1451 states and 5015 transitions. [2020-01-16 18:04:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:54,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:54,368 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:04:54,368 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:04:54,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:04:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 787. [2020-01-16 18:04:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:04:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-01-16 18:04:54,390 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-01-16 18:04:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:54,390 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-01-16 18:04:54,390 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-01-16 18:04:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:54,391 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:54,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:54,392 INFO L426 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1340772783, now seen corresponding path program 211 times [2020-01-16 18:04:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:54,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114369046] [2020-01-16 18:04:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:54,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114369046] [2020-01-16 18:04:54,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:54,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:54,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820252813] [2020-01-16 18:04:54,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:54,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:54,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:54,838 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:04:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:54,994 INFO L93 Difference]: Finished difference Result 1429 states and 4977 transitions. [2020-01-16 18:04:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:54,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:54,997 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:04:54,997 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:04:54,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:04:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 795. [2020-01-16 18:04:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:04:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-01-16 18:04:55,021 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-01-16 18:04:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:55,021 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-01-16 18:04:55,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-01-16 18:04:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:55,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:55,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:55,023 INFO L426 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253555, now seen corresponding path program 212 times [2020-01-16 18:04:55,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:55,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317214092] [2020-01-16 18:04:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:55,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-01-16 18:04:55,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317214092] [2020-01-16 18:04:55,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:55,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:55,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922089504] [2020-01-16 18:04:55,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:55,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:55,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:55,493 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:04:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:55,663 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-01-16 18:04:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:55,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:55,667 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:04:55,667 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:04:55,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:04:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 792. [2020-01-16 18:04:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:04:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:04:55,689 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:04:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:55,690 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:04:55,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:04:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:55,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:55,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:55,691 INFO L426 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1860102925, now seen corresponding path program 213 times [2020-01-16 18:04:55,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:55,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272207325] [2020-01-16 18:04:55,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:56,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-01-16 18:04:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272207325] [2020-01-16 18:04:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:56,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:56,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145720415] [2020-01-16 18:04:56,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:56,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:56,148 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:04:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:56,303 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-01-16 18:04:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:56,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:56,307 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:04:56,307 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:04:56,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:04:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 796. [2020-01-16 18:04:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:04:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-01-16 18:04:56,329 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-01-16 18:04:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:56,330 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-01-16 18:04:56,330 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-01-16 18:04:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:56,331 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:56,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:56,331 INFO L426 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1322247347, now seen corresponding path program 214 times [2020-01-16 18:04:56,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:56,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300022371] [2020-01-16 18:04:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:56,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300022371] [2020-01-16 18:04:56,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:56,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:56,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082857927] [2020-01-16 18:04:56,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:56,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:56,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:56,778 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:04:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:56,936 INFO L93 Difference]: Finished difference Result 1438 states and 4987 transitions. [2020-01-16 18:04:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:56,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:56,940 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:04:56,940 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:04:56,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:04:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 792. [2020-01-16 18:04:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:04:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:04:56,962 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:04:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:56,962 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:04:56,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:04:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:56,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:56,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] [2020-01-16 18:04:56,964 INFO L426 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:56,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1849599821, now seen corresponding path program 215 times [2020-01-16 18:04:56,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:56,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737956601] [2020-01-16 18:04:56,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:57,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737956601] [2020-01-16 18:04:57,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:57,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:57,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338228365] [2020-01-16 18:04:57,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:57,422 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:04:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:57,573 INFO L93 Difference]: Finished difference Result 1445 states and 5004 transitions. [2020-01-16 18:04:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:57,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:57,577 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:04:57,577 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:04:57,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:04:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 801. [2020-01-16 18:04:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:04:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3161 transitions. [2020-01-16 18:04:57,601 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3161 transitions. Word has length 25 [2020-01-16 18:04:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:57,602 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3161 transitions. [2020-01-16 18:04:57,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3161 transitions. [2020-01-16 18:04:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:57,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:57,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:57,603 INFO L426 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1372282095, now seen corresponding path program 216 times [2020-01-16 18:04:57,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:57,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856348881] [2020-01-16 18:04:57,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:58,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856348881] [2020-01-16 18:04:58,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:58,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:58,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558136265] [2020-01-16 18:04:58,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:58,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:58,085 INFO L87 Difference]: Start difference. First operand 801 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:04:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:58,218 INFO L93 Difference]: Finished difference Result 1447 states and 5000 transitions. [2020-01-16 18:04:58,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:58,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:58,222 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:04:58,222 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:04:58,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:04:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 782. [2020-01-16 18:04:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:04:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3122 transitions. [2020-01-16 18:04:58,244 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3122 transitions. Word has length 25 [2020-01-16 18:04:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:58,244 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3122 transitions. [2020-01-16 18:04:58,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3122 transitions. [2020-01-16 18:04:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:58,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:58,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:58,246 INFO L426 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash -842530889, now seen corresponding path program 217 times [2020-01-16 18:04:58,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:58,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048976028] [2020-01-16 18:04:58,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:58,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048976028] [2020-01-16 18:04:58,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:58,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:58,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102510963] [2020-01-16 18:04:58,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:58,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:58,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:58,707 INFO L87 Difference]: Start difference. First operand 782 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:04:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:58,873 INFO L93 Difference]: Finished difference Result 1432 states and 4997 transitions. [2020-01-16 18:04:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:58,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:58,877 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:04:58,878 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:04:58,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:04:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-01-16 18:04:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:04:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3161 transitions. [2020-01-16 18:04:58,899 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3161 transitions. Word has length 25 [2020-01-16 18:04:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:58,899 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3161 transitions. [2020-01-16 18:04:58,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3161 transitions. [2020-01-16 18:04:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:58,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:58,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:58,901 INFO L426 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 768410069, now seen corresponding path program 218 times [2020-01-16 18:04:58,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:58,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324565817] [2020-01-16 18:04:58,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:04:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:04:59,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324565817] [2020-01-16 18:04:59,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:04:59,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:04:59,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787989770] [2020-01-16 18:04:59,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:04:59,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:04:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:04:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:04:59,374 INFO L87 Difference]: Start difference. First operand 794 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:04:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:04:59,533 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:04:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:04:59,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:04:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:04:59,537 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:04:59,537 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:04:59,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:04:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:04:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-01-16 18:04:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:04:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3153 transitions. [2020-01-16 18:04:59,559 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3153 transitions. Word has length 25 [2020-01-16 18:04:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:04:59,559 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3153 transitions. [2020-01-16 18:04:59,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:04:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3153 transitions. [2020-01-16 18:04:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:04:59,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:04:59,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:04:59,561 INFO L426 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:04:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:04:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1851998553, now seen corresponding path program 219 times [2020-01-16 18:04:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:04:59,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50488720] [2020-01-16 18:04:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:04:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:00,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50488720] [2020-01-16 18:05:00,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:00,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:00,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012662693] [2020-01-16 18:05:00,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:00,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:00,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:00,016 INFO L87 Difference]: Start difference. First operand 791 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:05:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:00,183 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-01-16 18:05:00,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:00,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:00,187 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:05:00,187 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:05:00,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:05:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-01-16 18:05:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:05:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3164 transitions. [2020-01-16 18:05:00,210 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3164 transitions. Word has length 25 [2020-01-16 18:05:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:00,210 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3164 transitions. [2020-01-16 18:05:00,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3164 transitions. [2020-01-16 18:05:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:00,211 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:00,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:00,211 INFO L426 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash 778913173, now seen corresponding path program 220 times [2020-01-16 18:05:00,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:00,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213333419] [2020-01-16 18:05:00,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:00,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213333419] [2020-01-16 18:05:00,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:00,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:00,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145288816] [2020-01-16 18:05:00,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:00,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:00,672 INFO L87 Difference]: Start difference. First operand 797 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:05:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:00,833 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-01-16 18:05:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:00,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:00,838 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:05:00,838 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:05:00,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:05:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-01-16 18:05:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:05:00,860 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:05:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:00,861 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:05:00,861 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:05:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:00,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:00,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:00,862 INFO L426 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:00,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1862501657, now seen corresponding path program 221 times [2020-01-16 18:05:00,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:00,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492094893] [2020-01-16 18:05:00,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:01,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492094893] [2020-01-16 18:05:01,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:01,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:01,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886858985] [2020-01-16 18:05:01,324 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:01,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:01,324 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:05:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:01,505 INFO L93 Difference]: Finished difference Result 1430 states and 4987 transitions. [2020-01-16 18:05:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:01,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:01,510 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:05:01,510 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:05:01,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:05:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-01-16 18:05:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:05:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-01-16 18:05:01,534 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-01-16 18:05:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:01,534 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-01-16 18:05:01,534 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-01-16 18:05:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:01,535 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:01,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] [2020-01-16 18:05:01,535 INFO L426 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -821524681, now seen corresponding path program 222 times [2020-01-16 18:05:01,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:01,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853157761] [2020-01-16 18:05:01,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:02,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853157761] [2020-01-16 18:05:02,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:02,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:02,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953539095] [2020-01-16 18:05:02,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:02,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:02,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:02,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:02,001 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:05:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:02,168 INFO L93 Difference]: Finished difference Result 1434 states and 4992 transitions. [2020-01-16 18:05:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:02,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:02,172 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:05:02,172 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:05:02,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:05:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 788. [2020-01-16 18:05:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:05:02,195 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:05:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:02,195 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:05:02,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:05:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:02,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:02,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:02,197 INFO L426 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1285430029, now seen corresponding path program 223 times [2020-01-16 18:05:02,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:02,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040514014] [2020-01-16 18:05:02,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:02,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040514014] [2020-01-16 18:05:02,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:02,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:02,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938373388] [2020-01-16 18:05:02,661 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:02,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:02,661 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:05:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:02,822 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-01-16 18:05:02,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:02,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:02,826 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:05:02,827 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:05:02,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:05:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-01-16 18:05:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:05:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-01-16 18:05:02,850 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-01-16 18:05:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:02,851 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-01-16 18:05:02,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-01-16 18:05:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:02,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:02,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:02,852 INFO L426 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 325510929, now seen corresponding path program 224 times [2020-01-16 18:05:02,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:02,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761916342] [2020-01-16 18:05:02,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:03,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761916342] [2020-01-16 18:05:03,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:03,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:03,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273792613] [2020-01-16 18:05:03,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:03,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:03,332 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:05:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:03,517 INFO L93 Difference]: Finished difference Result 1434 states and 4995 transitions. [2020-01-16 18:05:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:03,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:03,522 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:05:03,522 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:05:03,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:05:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-01-16 18:05:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:05:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-01-16 18:05:03,549 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-01-16 18:05:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:03,549 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-01-16 18:05:03,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-01-16 18:05:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:03,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:03,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:03,550 INFO L426 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1791776295, now seen corresponding path program 225 times [2020-01-16 18:05:03,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:03,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871379058] [2020-01-16 18:05:03,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:04,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871379058] [2020-01-16 18:05:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844159323] [2020-01-16 18:05:04,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:04,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:04,008 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:05:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:04,169 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-01-16 18:05:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:04,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:04,173 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:05:04,173 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:05:04,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:05:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 799. [2020-01-16 18:05:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:05:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3166 transitions. [2020-01-16 18:05:04,196 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3166 transitions. Word has length 25 [2020-01-16 18:05:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:04,196 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3166 transitions. [2020-01-16 18:05:04,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3166 transitions. [2020-01-16 18:05:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:04,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:04,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:04,197 INFO L426 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 357020241, now seen corresponding path program 226 times [2020-01-16 18:05:04,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:04,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113544757] [2020-01-16 18:05:04,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113544757] [2020-01-16 18:05:04,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:04,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:04,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138438299] [2020-01-16 18:05:04,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:04,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:04,680 INFO L87 Difference]: Start difference. First operand 799 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:05:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:04,816 INFO L93 Difference]: Finished difference Result 1450 states and 5022 transitions. [2020-01-16 18:05:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:04,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:04,820 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:05:04,821 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:05:04,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:05:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 792. [2020-01-16 18:05:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:05:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:05:04,844 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:05:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:04,844 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:05:04,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:05:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:04,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:04,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] [2020-01-16 18:05:04,845 INFO L426 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1781273191, now seen corresponding path program 227 times [2020-01-16 18:05:04,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:04,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986833800] [2020-01-16 18:05:04,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:05,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986833800] [2020-01-16 18:05:05,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:05,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:05,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627799784] [2020-01-16 18:05:05,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:05,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:05,311 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:05:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:05,497 INFO L93 Difference]: Finished difference Result 1438 states and 4998 transitions. [2020-01-16 18:05:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:05,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:05,501 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:05:05,501 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:05:05,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:05:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 796. [2020-01-16 18:05:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:05:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-01-16 18:05:05,524 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-01-16 18:05:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:05,524 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-01-16 18:05:05,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-01-16 18:05:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:05,525 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:05,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:05,526 INFO L426 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1243417613, now seen corresponding path program 228 times [2020-01-16 18:05:05,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:05,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076465554] [2020-01-16 18:05:05,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:06,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076465554] [2020-01-16 18:05:06,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:06,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:06,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711967959] [2020-01-16 18:05:06,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:06,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:06,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:06,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:06,002 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:05:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:06,137 INFO L93 Difference]: Finished difference Result 1444 states and 5006 transitions. [2020-01-16 18:05:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:06,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:06,142 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:05:06,142 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:05:06,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:05:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 788. [2020-01-16 18:05:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:05:06,164 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:05:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:06,164 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:05:06,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:05:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:06,165 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:06,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] [2020-01-16 18:05:06,166 INFO L426 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash -959833805, now seen corresponding path program 229 times [2020-01-16 18:05:06,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:06,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46013706] [2020-01-16 18:05:06,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:06,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46013706] [2020-01-16 18:05:06,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:06,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:06,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173066077] [2020-01-16 18:05:06,635 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:06,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:06,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:06,635 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:05:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:06,797 INFO L93 Difference]: Finished difference Result 1461 states and 5062 transitions. [2020-01-16 18:05:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:06,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:06,800 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:05:06,801 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:05:06,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:05:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 803. [2020-01-16 18:05:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:05:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3178 transitions. [2020-01-16 18:05:06,824 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3178 transitions. Word has length 25 [2020-01-16 18:05:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:06,824 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3178 transitions. [2020-01-16 18:05:06,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3178 transitions. [2020-01-16 18:05:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:06,825 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:06,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] [2020-01-16 18:05:06,826 INFO L426 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2032919185, now seen corresponding path program 230 times [2020-01-16 18:05:06,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:06,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151258170] [2020-01-16 18:05:06,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:07,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151258170] [2020-01-16 18:05:07,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:07,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:07,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302193923] [2020-01-16 18:05:07,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:07,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:07,302 INFO L87 Difference]: Start difference. First operand 803 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:05:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:07,482 INFO L93 Difference]: Finished difference Result 1462 states and 5058 transitions. [2020-01-16 18:05:07,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:07,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:07,486 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:05:07,486 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:05:07,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:05:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 797. [2020-01-16 18:05:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:05:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:05:07,509 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:05:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:07,509 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:05:07,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:05:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:07,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:07,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] [2020-01-16 18:05:07,510 INFO L426 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 134257783, now seen corresponding path program 231 times [2020-01-16 18:05:07,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:07,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562466730] [2020-01-16 18:05:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:07,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562466730] [2020-01-16 18:05:07,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:07,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:07,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457889250] [2020-01-16 18:05:07,983 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:07,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:07,983 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:05:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:08,190 INFO L93 Difference]: Finished difference Result 1464 states and 5061 transitions. [2020-01-16 18:05:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:08,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:08,194 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:05:08,194 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:05:08,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:05:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 804. [2020-01-16 18:05:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:05:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-01-16 18:05:08,216 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-01-16 18:05:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:08,216 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-01-16 18:05:08,216 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-01-16 18:05:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:08,217 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:08,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:08,217 INFO L426 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2011912977, now seen corresponding path program 232 times [2020-01-16 18:05:08,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:08,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396730850] [2020-01-16 18:05:08,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:08,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396730850] [2020-01-16 18:05:08,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:08,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:08,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223409904] [2020-01-16 18:05:08,691 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:08,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:08,692 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:05:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:08,826 INFO L93 Difference]: Finished difference Result 1467 states and 5060 transitions. [2020-01-16 18:05:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:08,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:08,831 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:05:08,831 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:05:08,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:05:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 797. [2020-01-16 18:05:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:05:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-01-16 18:05:08,862 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:08,862 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-01-16 18:05:08,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-01-16 18:05:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:08,864 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:08,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:08,864 INFO L426 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 155263991, now seen corresponding path program 233 times [2020-01-16 18:05:08,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:08,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011471419] [2020-01-16 18:05:08,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:09,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011471419] [2020-01-16 18:05:09,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:09,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:09,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554105586] [2020-01-16 18:05:09,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:09,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:09,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:09,335 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:09,503 INFO L93 Difference]: Finished difference Result 1468 states and 5062 transitions. [2020-01-16 18:05:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:09,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:09,507 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:05:09,507 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:05:09,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:05:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 806. [2020-01-16 18:05:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:05:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3170 transitions. [2020-01-16 18:05:09,530 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3170 transitions. Word has length 25 [2020-01-16 18:05:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:09,530 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3170 transitions. [2020-01-16 18:05:09,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3170 transitions. [2020-01-16 18:05:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:09,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:09,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:09,532 INFO L426 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:09,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash -917821389, now seen corresponding path program 234 times [2020-01-16 18:05:09,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:09,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506750226] [2020-01-16 18:05:09,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:10,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506750226] [2020-01-16 18:05:10,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:10,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:10,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247986282] [2020-01-16 18:05:10,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:10,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:10,014 INFO L87 Difference]: Start difference. First operand 806 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:05:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:10,195 INFO L93 Difference]: Finished difference Result 1470 states and 5058 transitions. [2020-01-16 18:05:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:10,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:10,199 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:05:10,199 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:05:10,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:05:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 788. [2020-01-16 18:05:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3132 transitions. [2020-01-16 18:05:10,222 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3132 transitions. Word has length 25 [2020-01-16 18:05:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:10,222 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3132 transitions. [2020-01-16 18:05:10,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3132 transitions. [2020-01-16 18:05:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:10,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:10,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:10,223 INFO L426 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash 976703377, now seen corresponding path program 235 times [2020-01-16 18:05:10,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:10,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114563286] [2020-01-16 18:05:10,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:10,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114563286] [2020-01-16 18:05:10,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:10,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:10,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736440998] [2020-01-16 18:05:10,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:10,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:10,678 INFO L87 Difference]: Start difference. First operand 788 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:05:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:10,863 INFO L93 Difference]: Finished difference Result 1439 states and 4998 transitions. [2020-01-16 18:05:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:10,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:10,868 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:05:10,868 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:05:10,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:05:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 796. [2020-01-16 18:05:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:05:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-01-16 18:05:10,891 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-01-16 18:05:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:10,891 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-01-16 18:05:10,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-01-16 18:05:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:10,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:10,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:10,892 INFO L426 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1707322961, now seen corresponding path program 236 times [2020-01-16 18:05:10,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:10,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427529342] [2020-01-16 18:05:10,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:11,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427529342] [2020-01-16 18:05:11,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:11,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:11,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658500568] [2020-01-16 18:05:11,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:11,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:11,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:11,357 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:05:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:11,530 INFO L93 Difference]: Finished difference Result 1443 states and 5003 transitions. [2020-01-16 18:05:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:11,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:11,534 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:05:11,534 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:05:11,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:05:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-01-16 18:05:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-01-16 18:05:11,556 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-01-16 18:05:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:11,556 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-01-16 18:05:11,556 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-01-16 18:05:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:11,557 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:11,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:11,557 INFO L426 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:11,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2070794965, now seen corresponding path program 237 times [2020-01-16 18:05:11,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:11,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808048392] [2020-01-16 18:05:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:12,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808048392] [2020-01-16 18:05:12,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:12,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:12,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110170223] [2020-01-16 18:05:12,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:12,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:12,012 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:05:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:12,177 INFO L93 Difference]: Finished difference Result 1442 states and 5000 transitions. [2020-01-16 18:05:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:12,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:12,181 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:05:12,182 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:05:12,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:05:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2020-01-16 18:05:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:05:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3152 transitions. [2020-01-16 18:05:12,204 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3152 transitions. Word has length 25 [2020-01-16 18:05:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:12,204 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3152 transitions. [2020-01-16 18:05:12,205 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3152 transitions. [2020-01-16 18:05:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:12,206 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:12,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:12,206 INFO L426 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1686316753, now seen corresponding path program 238 times [2020-01-16 18:05:12,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:12,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474048405] [2020-01-16 18:05:12,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:12,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-01-16 18:05:12,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474048405] [2020-01-16 18:05:12,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:12,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:12,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535997545] [2020-01-16 18:05:12,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:12,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:12,675 INFO L87 Difference]: Start difference. First operand 797 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:05:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:12,818 INFO L93 Difference]: Finished difference Result 1448 states and 5008 transitions. [2020-01-16 18:05:12,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:12,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:12,822 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:05:12,822 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:05:12,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:05:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 793. [2020-01-16 18:05:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3141 transitions. [2020-01-16 18:05:12,845 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3141 transitions. Word has length 25 [2020-01-16 18:05:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:12,845 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3141 transitions. [2020-01-16 18:05:12,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3141 transitions. [2020-01-16 18:05:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:12,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:12,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:12,846 INFO L426 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2081298069, now seen corresponding path program 239 times [2020-01-16 18:05:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181945454] [2020-01-16 18:05:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:13,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181945454] [2020-01-16 18:05:13,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:13,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:13,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775051738] [2020-01-16 18:05:13,312 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:13,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:13,313 INFO L87 Difference]: Start difference. First operand 793 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:05:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:13,472 INFO L93 Difference]: Finished difference Result 1455 states and 5025 transitions. [2020-01-16 18:05:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:13,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:13,476 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:05:13,476 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:05:13,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:05:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 802. [2020-01-16 18:05:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:05:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3157 transitions. [2020-01-16 18:05:13,499 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3157 transitions. Word has length 25 [2020-01-16 18:05:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:13,499 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3157 transitions. [2020-01-16 18:05:13,500 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3157 transitions. [2020-01-16 18:05:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:13,501 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:13,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:13,501 INFO L426 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1008212689, now seen corresponding path program 240 times [2020-01-16 18:05:13,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:13,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828593182] [2020-01-16 18:05:13,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:13,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828593182] [2020-01-16 18:05:13,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:13,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:13,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792883197] [2020-01-16 18:05:13,969 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:13,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:13,969 INFO L87 Difference]: Start difference. First operand 802 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:05:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:14,114 INFO L93 Difference]: Finished difference Result 1457 states and 5021 transitions. [2020-01-16 18:05:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:14,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:14,118 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:05:14,118 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:05:14,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:05:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 776. [2020-01-16 18:05:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:05:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3105 transitions. [2020-01-16 18:05:14,140 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3105 transitions. Word has length 25 [2020-01-16 18:05:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:14,141 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3105 transitions. [2020-01-16 18:05:14,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3105 transitions. [2020-01-16 18:05:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:14,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:14,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:14,142 INFO L426 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash -858812617, now seen corresponding path program 241 times [2020-01-16 18:05:14,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:14,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681093951] [2020-01-16 18:05:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:14,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681093951] [2020-01-16 18:05:14,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:14,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:14,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516539251] [2020-01-16 18:05:14,595 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:14,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:14,595 INFO L87 Difference]: Start difference. First operand 776 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:05:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:14,760 INFO L93 Difference]: Finished difference Result 1381 states and 4884 transitions. [2020-01-16 18:05:14,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:14,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:14,764 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:05:14,764 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:05:14,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:05:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 790. [2020-01-16 18:05:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-01-16 18:05:14,786 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-01-16 18:05:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:14,786 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-01-16 18:05:14,786 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-01-16 18:05:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:14,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:14,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] [2020-01-16 18:05:14,787 INFO L426 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash 111438997, now seen corresponding path program 242 times [2020-01-16 18:05:14,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:14,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827310417] [2020-01-16 18:05:14,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:15,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827310417] [2020-01-16 18:05:15,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:15,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:15,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268977663] [2020-01-16 18:05:15,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:15,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:15,243 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:05:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:15,405 INFO L93 Difference]: Finished difference Result 1383 states and 4884 transitions. [2020-01-16 18:05:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:15,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:15,409 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:05:15,409 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:05:15,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:05:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 786. [2020-01-16 18:05:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-01-16 18:05:15,434 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-01-16 18:05:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:15,434 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-01-16 18:05:15,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-01-16 18:05:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:15,435 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:15,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:15,435 INFO L426 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1067221461, now seen corresponding path program 243 times [2020-01-16 18:05:15,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:15,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257010589] [2020-01-16 18:05:15,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:15,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257010589] [2020-01-16 18:05:15,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:15,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:15,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437576589] [2020-01-16 18:05:15,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:15,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:15,898 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:05:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:16,052 INFO L93 Difference]: Finished difference Result 1377 states and 4872 transitions. [2020-01-16 18:05:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:16,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:16,057 INFO L225 Difference]: With dead ends: 1377 [2020-01-16 18:05:16,057 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:05:16,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:05:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-01-16 18:05:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:05:16,079 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:16,080 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:05:16,080 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:05:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:16,081 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:16,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:16,081 INFO L426 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2047976179, now seen corresponding path program 244 times [2020-01-16 18:05:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:16,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180091008] [2020-01-16 18:05:16,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:16,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-01-16 18:05:16,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180091008] [2020-01-16 18:05:16,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:16,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:16,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880092429] [2020-01-16 18:05:16,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:16,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:16,538 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:16,699 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-01-16 18:05:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:16,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:16,703 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:05:16,703 INFO L226 Difference]: Without dead ends: 1361 [2020-01-16 18:05:16,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-01-16 18:05:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 786. [2020-01-16 18:05:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-01-16 18:05:16,725 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-01-16 18:05:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:16,725 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-01-16 18:05:16,725 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-01-16 18:05:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:16,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:16,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:16,727 INFO L426 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 450064183, now seen corresponding path program 245 times [2020-01-16 18:05:16,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116072396] [2020-01-16 18:05:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:17,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116072396] [2020-01-16 18:05:17,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:17,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:17,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813059484] [2020-01-16 18:05:17,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:17,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:17,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:17,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:17,176 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:05:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:17,336 INFO L93 Difference]: Finished difference Result 1381 states and 4877 transitions. [2020-01-16 18:05:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:17,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:17,340 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:05:17,340 INFO L226 Difference]: Without dead ends: 1366 [2020-01-16 18:05:17,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-01-16 18:05:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 789. [2020-01-16 18:05:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:05:17,364 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:05:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:17,364 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:05:17,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:05:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:17,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:17,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:17,366 INFO L426 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2061005141, now seen corresponding path program 246 times [2020-01-16 18:05:17,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:17,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704408710] [2020-01-16 18:05:17,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:17,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-01-16 18:05:17,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704408710] [2020-01-16 18:05:17,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:17,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:17,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056778436] [2020-01-16 18:05:17,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:17,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:17,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:17,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:17,821 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:05:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:17,977 INFO L93 Difference]: Finished difference Result 1378 states and 4868 transitions. [2020-01-16 18:05:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:17,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:17,981 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:05:17,981 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:05:17,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:05:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 783. [2020-01-16 18:05:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:05:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3138 transitions. [2020-01-16 18:05:18,004 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3138 transitions. Word has length 25 [2020-01-16 18:05:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:18,004 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3138 transitions. [2020-01-16 18:05:18,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3138 transitions. [2020-01-16 18:05:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:18,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:18,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:18,006 INFO L426 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1703784069, now seen corresponding path program 247 times [2020-01-16 18:05:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:18,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331596166] [2020-01-16 18:05:18,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331596166] [2020-01-16 18:05:18,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:18,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:18,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312026336] [2020-01-16 18:05:18,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:18,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:18,475 INFO L87 Difference]: Start difference. First operand 783 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:05:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:18,673 INFO L93 Difference]: Finished difference Result 1387 states and 4898 transitions. [2020-01-16 18:05:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:18,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:18,677 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:05:18,677 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:05:18,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:05:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-01-16 18:05:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-01-16 18:05:18,700 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-01-16 18:05:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:18,700 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-01-16 18:05:18,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-01-16 18:05:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:18,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:18,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] [2020-01-16 18:05:18,701 INFO L426 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -733532455, now seen corresponding path program 248 times [2020-01-16 18:05:18,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:18,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825310440] [2020-01-16 18:05:18,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:19,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825310440] [2020-01-16 18:05:19,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543355365] [2020-01-16 18:05:19,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:19,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:19,164 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:05:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:19,315 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:05:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:19,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:19,319 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:05:19,319 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:05:19,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:05:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:05:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:05:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3149 transitions. [2020-01-16 18:05:19,341 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3149 transitions. Word has length 25 [2020-01-16 18:05:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:19,341 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3149 transitions. [2020-01-16 18:05:19,341 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3149 transitions. [2020-01-16 18:05:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:19,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:19,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:19,343 INFO L426 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash -220649131, now seen corresponding path program 249 times [2020-01-16 18:05:19,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:19,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584390807] [2020-01-16 18:05:19,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:19,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584390807] [2020-01-16 18:05:19,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:19,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:19,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799483369] [2020-01-16 18:05:19,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:19,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:19,828 INFO L87 Difference]: Start difference. First operand 787 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:05:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:19,983 INFO L93 Difference]: Finished difference Result 1386 states and 4892 transitions. [2020-01-16 18:05:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:19,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:19,989 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:05:19,989 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:05:19,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:05:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 791. [2020-01-16 18:05:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-01-16 18:05:20,017 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-01-16 18:05:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:20,017 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-01-16 18:05:20,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-01-16 18:05:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:20,018 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:20,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:20,019 INFO L426 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash 781111795, now seen corresponding path program 250 times [2020-01-16 18:05:20,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:20,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901215026] [2020-01-16 18:05:20,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:20,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901215026] [2020-01-16 18:05:20,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:20,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:20,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602824238] [2020-01-16 18:05:20,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:20,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:20,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:20,488 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:05:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:20,655 INFO L93 Difference]: Finished difference Result 1387 states and 4890 transitions. [2020-01-16 18:05:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:20,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:20,659 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:05:20,659 INFO L226 Difference]: Without dead ends: 1369 [2020-01-16 18:05:20,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-01-16 18:05:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 787. [2020-01-16 18:05:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:05:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-01-16 18:05:20,682 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-01-16 18:05:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:20,682 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-01-16 18:05:20,682 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-01-16 18:05:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:20,683 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:20,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] [2020-01-16 18:05:20,683 INFO L426 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 256285179, now seen corresponding path program 251 times [2020-01-16 18:05:20,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:20,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54756371] [2020-01-16 18:05:20,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:21,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54756371] [2020-01-16 18:05:21,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:21,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:21,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336904088] [2020-01-16 18:05:21,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:21,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:21,146 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:05:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:21,295 INFO L93 Difference]: Finished difference Result 1391 states and 4899 transitions. [2020-01-16 18:05:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:21,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:21,299 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:05:21,299 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:05:21,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:05:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-01-16 18:05:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:05:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-01-16 18:05:21,321 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:21,322 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-01-16 18:05:21,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-01-16 18:05:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:21,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:21,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:21,323 INFO L426 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 794140757, now seen corresponding path program 252 times [2020-01-16 18:05:21,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:21,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713272642] [2020-01-16 18:05:21,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:21,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713272642] [2020-01-16 18:05:21,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:21,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:21,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276118727] [2020-01-16 18:05:21,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:21,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:21,781 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:21,959 INFO L93 Difference]: Finished difference Result 1390 states and 4892 transitions. [2020-01-16 18:05:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:21,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:21,963 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:05:21,964 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:05:21,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:05:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-01-16 18:05:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:05:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3135 transitions. [2020-01-16 18:05:21,986 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3135 transitions. Word has length 25 [2020-01-16 18:05:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:21,987 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3135 transitions. [2020-01-16 18:05:21,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3135 transitions. [2020-01-16 18:05:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:21,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:21,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:21,988 INFO L426 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash -200235717, now seen corresponding path program 253 times [2020-01-16 18:05:21,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:21,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100640643] [2020-01-16 18:05:21,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:22,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100640643] [2020-01-16 18:05:22,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:22,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:22,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743178642] [2020-01-16 18:05:22,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:22,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:22,446 INFO L87 Difference]: Start difference. First operand 783 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:05:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:22,603 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-01-16 18:05:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:22,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:22,607 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:05:22,607 INFO L226 Difference]: Without dead ends: 1363 [2020-01-16 18:05:22,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-01-16 18:05:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 789. [2020-01-16 18:05:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-01-16 18:05:22,630 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-01-16 18:05:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:22,630 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-01-16 18:05:22,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-01-16 18:05:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:22,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:22,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:22,631 INFO L426 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 780519001, now seen corresponding path program 254 times [2020-01-16 18:05:22,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:22,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126220408] [2020-01-16 18:05:22,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:23,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-01-16 18:05:23,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126220408] [2020-01-16 18:05:23,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:23,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:23,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272528971] [2020-01-16 18:05:23,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:23,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:23,083 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:05:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:23,239 INFO L93 Difference]: Finished difference Result 1375 states and 4862 transitions. [2020-01-16 18:05:23,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:23,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:23,242 INFO L225 Difference]: With dead ends: 1375 [2020-01-16 18:05:23,242 INFO L226 Difference]: Without dead ends: 1360 [2020-01-16 18:05:23,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-01-16 18:05:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-01-16 18:05:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3143 transitions. [2020-01-16 18:05:23,263 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3143 transitions. Word has length 25 [2020-01-16 18:05:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:23,263 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3143 transitions. [2020-01-16 18:05:23,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3143 transitions. [2020-01-16 18:05:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:23,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:23,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:23,265 INFO L426 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -643134857, now seen corresponding path program 255 times [2020-01-16 18:05:23,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313639999] [2020-01-16 18:05:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:23,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313639999] [2020-01-16 18:05:23,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:23,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:23,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130846291] [2020-01-16 18:05:23,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:23,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:23,730 INFO L87 Difference]: Start difference. First operand 786 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:05:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:23,907 INFO L93 Difference]: Finished difference Result 1379 states and 4871 transitions. [2020-01-16 18:05:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:23,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:23,911 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:05:23,911 INFO L226 Difference]: Without dead ends: 1366 [2020-01-16 18:05:23,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-01-16 18:05:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 790. [2020-01-16 18:05:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:05:23,933 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:05:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:23,934 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:05:23,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:05:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:23,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:23,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:23,935 INFO L426 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash 358626069, now seen corresponding path program 256 times [2020-01-16 18:05:23,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:23,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400848605] [2020-01-16 18:05:23,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400848605] [2020-01-16 18:05:24,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:24,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:24,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336217286] [2020-01-16 18:05:24,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:24,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:24,482 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:05:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:24,649 INFO L93 Difference]: Finished difference Result 1380 states and 4869 transitions. [2020-01-16 18:05:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:24,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:24,652 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:05:24,653 INFO L226 Difference]: Without dead ends: 1362 [2020-01-16 18:05:24,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-01-16 18:05:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 786. [2020-01-16 18:05:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-01-16 18:05:24,674 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-01-16 18:05:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:24,674 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-01-16 18:05:24,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-01-16 18:05:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:24,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:24,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:24,676 INFO L426 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1770336635, now seen corresponding path program 257 times [2020-01-16 18:05:24,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:24,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444356540] [2020-01-16 18:05:24,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444356540] [2020-01-16 18:05:25,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:25,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:25,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470639928] [2020-01-16 18:05:25,130 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:25,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:25,131 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:05:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:25,308 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-01-16 18:05:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:25,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:25,313 INFO L225 Difference]: With dead ends: 1376 [2020-01-16 18:05:25,313 INFO L226 Difference]: Without dead ends: 1364 [2020-01-16 18:05:25,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-01-16 18:05:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-01-16 18:05:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-01-16 18:05:25,335 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-01-16 18:05:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:25,335 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-01-16 18:05:25,335 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-01-16 18:05:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:25,336 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:25,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:25,336 INFO L426 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 697251255, now seen corresponding path program 258 times [2020-01-16 18:05:25,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:25,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809178008] [2020-01-16 18:05:25,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:25,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809178008] [2020-01-16 18:05:25,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:25,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:25,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002444309] [2020-01-16 18:05:25,792 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:25,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:25,792 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:05:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:25,957 INFO L93 Difference]: Finished difference Result 1378 states and 4862 transitions. [2020-01-16 18:05:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:25,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:25,961 INFO L225 Difference]: With dead ends: 1378 [2020-01-16 18:05:25,962 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:05:25,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:05:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 783. [2020-01-16 18:05:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:05:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-01-16 18:05:25,984 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-01-16 18:05:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:25,984 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-01-16 18:05:25,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-01-16 18:05:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:25,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:25,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:25,985 INFO L426 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1069639765, now seen corresponding path program 259 times [2020-01-16 18:05:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:25,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128605671] [2020-01-16 18:05:25,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:26,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128605671] [2020-01-16 18:05:26,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:26,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:26,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990084114] [2020-01-16 18:05:26,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:26,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:26,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:26,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:26,448 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:05:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:26,601 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-01-16 18:05:26,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:26,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:26,606 INFO L225 Difference]: With dead ends: 1383 [2020-01-16 18:05:26,606 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:05:26,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:05:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 789. [2020-01-16 18:05:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:05:26,628 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:05:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:26,628 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:05:26,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:05:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:26,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:26,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:26,629 INFO L426 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1614386573, now seen corresponding path program 260 times [2020-01-16 18:05:26,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:26,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648288800] [2020-01-16 18:05:26,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:27,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648288800] [2020-01-16 18:05:27,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:27,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:27,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27427075] [2020-01-16 18:05:27,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:27,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:27,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:27,082 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:05:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:27,250 INFO L93 Difference]: Finished difference Result 1380 states and 4870 transitions. [2020-01-16 18:05:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:27,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:27,254 INFO L225 Difference]: With dead ends: 1380 [2020-01-16 18:05:27,254 INFO L226 Difference]: Without dead ends: 1365 [2020-01-16 18:05:27,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-01-16 18:05:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 786. [2020-01-16 18:05:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-01-16 18:05:27,276 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-01-16 18:05:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:27,276 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-01-16 18:05:27,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-01-16 18:05:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:27,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:27,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] [2020-01-16 18:05:27,277 INFO L426 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2131235943, now seen corresponding path program 261 times [2020-01-16 18:05:27,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:27,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773417625] [2020-01-16 18:05:27,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:27,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773417625] [2020-01-16 18:05:27,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:27,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:27,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134358845] [2020-01-16 18:05:27,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:27,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:27,732 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:05:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:27,901 INFO L93 Difference]: Finished difference Result 1387 states and 4886 transitions. [2020-01-16 18:05:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:27,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:27,905 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:05:27,905 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:05:27,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:05:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-01-16 18:05:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-01-16 18:05:27,928 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-01-16 18:05:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:27,928 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-01-16 18:05:27,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-01-16 18:05:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:27,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:27,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:27,929 INFO L426 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1593380365, now seen corresponding path program 262 times [2020-01-16 18:05:27,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:27,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909932693] [2020-01-16 18:05:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:28,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909932693] [2020-01-16 18:05:28,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:28,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:28,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761344432] [2020-01-16 18:05:28,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:28,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:28,390 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:05:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:28,552 INFO L93 Difference]: Finished difference Result 1386 states and 4879 transitions. [2020-01-16 18:05:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:28,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:28,556 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:05:28,556 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:05:28,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:05:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 786. [2020-01-16 18:05:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:05:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-01-16 18:05:28,579 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-01-16 18:05:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:28,579 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-01-16 18:05:28,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-01-16 18:05:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:28,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:28,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:28,580 INFO L426 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2120732839, now seen corresponding path program 263 times [2020-01-16 18:05:28,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:28,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972177819] [2020-01-16 18:05:28,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:29,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-01-16 18:05:29,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972177819] [2020-01-16 18:05:29,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:29,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:29,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013683671] [2020-01-16 18:05:29,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:29,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:29,042 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:05:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:29,218 INFO L93 Difference]: Finished difference Result 1379 states and 4865 transitions. [2020-01-16 18:05:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:29,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:29,221 INFO L225 Difference]: With dead ends: 1379 [2020-01-16 18:05:29,222 INFO L226 Difference]: Without dead ends: 1367 [2020-01-16 18:05:29,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-01-16 18:05:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 789. [2020-01-16 18:05:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-01-16 18:05:29,244 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-01-16 18:05:29,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:29,244 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-01-16 18:05:29,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-01-16 18:05:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:29,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:29,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:29,246 INFO L426 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1101149077, now seen corresponding path program 264 times [2020-01-16 18:05:29,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:29,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547348094] [2020-01-16 18:05:29,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:29,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547348094] [2020-01-16 18:05:29,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:29,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320076266] [2020-01-16 18:05:29,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:29,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:29,689 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:05:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:29,844 INFO L93 Difference]: Finished difference Result 1381 states and 4866 transitions. [2020-01-16 18:05:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:29,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:29,848 INFO L225 Difference]: With dead ends: 1381 [2020-01-16 18:05:29,848 INFO L226 Difference]: Without dead ends: 1358 [2020-01-16 18:05:29,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-01-16 18:05:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 780. [2020-01-16 18:05:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:05:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3124 transitions. [2020-01-16 18:05:29,873 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3124 transitions. Word has length 25 [2020-01-16 18:05:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:29,874 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3124 transitions. [2020-01-16 18:05:29,874 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3124 transitions. [2020-01-16 18:05:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:29,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:29,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:29,875 INFO L426 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1070968235, now seen corresponding path program 265 times [2020-01-16 18:05:29,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:29,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443548381] [2020-01-16 18:05:29,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:30,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443548381] [2020-01-16 18:05:30,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:30,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:30,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790002150] [2020-01-16 18:05:30,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:30,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:30,315 INFO L87 Difference]: Start difference. First operand 780 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:05:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:30,500 INFO L93 Difference]: Finished difference Result 1393 states and 4910 transitions. [2020-01-16 18:05:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:30,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:30,504 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:05:30,504 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:05:30,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:05:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-01-16 18:05:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-01-16 18:05:30,527 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-01-16 18:05:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:30,527 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-01-16 18:05:30,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-01-16 18:05:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:30,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:30,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:30,528 INFO L426 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash -100716621, now seen corresponding path program 266 times [2020-01-16 18:05:30,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:30,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264012714] [2020-01-16 18:05:30,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264012714] [2020-01-16 18:05:30,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:30,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:30,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738156273] [2020-01-16 18:05:30,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:30,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:30,966 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:05:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:31,137 INFO L93 Difference]: Finished difference Result 1395 states and 4910 transitions. [2020-01-16 18:05:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:31,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:31,141 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:05:31,141 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:05:31,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:05:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-01-16 18:05:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:05:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3150 transitions. [2020-01-16 18:05:31,163 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3150 transitions. Word has length 25 [2020-01-16 18:05:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:31,163 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3150 transitions. [2020-01-16 18:05:31,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3150 transitions. [2020-01-16 18:05:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:31,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:31,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:31,164 INFO L426 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash 855065843, now seen corresponding path program 267 times [2020-01-16 18:05:31,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:31,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372564576] [2020-01-16 18:05:31,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:31,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372564576] [2020-01-16 18:05:31,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:31,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:31,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907659526] [2020-01-16 18:05:31,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:31,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:31,628 INFO L87 Difference]: Start difference. First operand 787 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:05:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:31,793 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-01-16 18:05:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:31,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:31,797 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:05:31,797 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:05:31,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:05:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-01-16 18:05:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-01-16 18:05:31,819 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-01-16 18:05:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:31,819 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-01-16 18:05:31,819 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-01-16 18:05:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:31,820 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:31,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:31,821 INFO L426 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1835820561, now seen corresponding path program 268 times [2020-01-16 18:05:31,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:31,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224386465] [2020-01-16 18:05:31,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:32,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224386465] [2020-01-16 18:05:32,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:32,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:32,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214214587] [2020-01-16 18:05:32,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:32,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:32,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:32,278 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:05:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:32,442 INFO L93 Difference]: Finished difference Result 1388 states and 4893 transitions. [2020-01-16 18:05:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:32,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:32,446 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:05:32,446 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:05:32,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:05:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:05:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:05:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-01-16 18:05:32,468 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-01-16 18:05:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:32,469 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-01-16 18:05:32,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-01-16 18:05:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:32,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:32,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] [2020-01-16 18:05:32,470 INFO L426 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 237908565, now seen corresponding path program 269 times [2020-01-16 18:05:32,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:32,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286724347] [2020-01-16 18:05:32,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:32,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286724347] [2020-01-16 18:05:32,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:32,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:32,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452111004] [2020-01-16 18:05:32,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:32,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:32,938 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:05:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:33,108 INFO L93 Difference]: Finished difference Result 1393 states and 4903 transitions. [2020-01-16 18:05:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:33,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:33,112 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:05:33,112 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:05:33,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:05:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 790. [2020-01-16 18:05:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-01-16 18:05:33,135 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-01-16 18:05:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:33,135 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-01-16 18:05:33,135 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-01-16 18:05:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:33,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:33,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:33,136 INFO L426 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849523, now seen corresponding path program 270 times [2020-01-16 18:05:33,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:33,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008620127] [2020-01-16 18:05:33,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:33,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008620127] [2020-01-16 18:05:33,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:33,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:33,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849980898] [2020-01-16 18:05:33,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:33,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:33,585 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:05:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:33,764 INFO L93 Difference]: Finished difference Result 1390 states and 4894 transitions. [2020-01-16 18:05:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:33,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:33,767 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:05:33,767 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:05:33,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:05:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 784. [2020-01-16 18:05:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:05:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3139 transitions. [2020-01-16 18:05:33,789 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3139 transitions. Word has length 25 [2020-01-16 18:05:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:33,789 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3139 transitions. [2020-01-16 18:05:33,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3139 transitions. [2020-01-16 18:05:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:33,790 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:33,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] [2020-01-16 18:05:33,790 INFO L426 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1956541883, now seen corresponding path program 271 times [2020-01-16 18:05:33,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:33,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117795327] [2020-01-16 18:05:33,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:34,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117795327] [2020-01-16 18:05:34,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:34,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:34,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022151253] [2020-01-16 18:05:34,229 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:34,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:34,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:34,230 INFO L87 Difference]: Start difference. First operand 784 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:05:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:34,381 INFO L93 Difference]: Finished difference Result 1407 states and 4941 transitions. [2020-01-16 18:05:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:34,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:34,386 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:05:34,386 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:05:34,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:05:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 793. [2020-01-16 18:05:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-01-16 18:05:34,408 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-01-16 18:05:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:34,408 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-01-16 18:05:34,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-01-16 18:05:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:34,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:34,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:34,410 INFO L426 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173799, now seen corresponding path program 272 times [2020-01-16 18:05:34,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:34,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000043814] [2020-01-16 18:05:34,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:34,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-01-16 18:05:34,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000043814] [2020-01-16 18:05:34,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:34,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:34,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266348124] [2020-01-16 18:05:34,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:34,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:34,850 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:05:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:35,024 INFO L93 Difference]: Finished difference Result 1409 states and 4941 transitions. [2020-01-16 18:05:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:35,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:35,029 INFO L225 Difference]: With dead ends: 1409 [2020-01-16 18:05:35,029 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:05:35,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:05:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:05:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3153 transitions. [2020-01-16 18:05:35,051 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3153 transitions. Word has length 25 [2020-01-16 18:05:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:35,051 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3153 transitions. [2020-01-16 18:05:35,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3153 transitions. [2020-01-16 18:05:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:35,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:35,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:35,053 INFO L426 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:35,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1070743603, now seen corresponding path program 273 times [2020-01-16 18:05:35,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:35,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429669165] [2020-01-16 18:05:35,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:35,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-01-16 18:05:35,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429669165] [2020-01-16 18:05:35,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:35,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:35,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254935882] [2020-01-16 18:05:35,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:35,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:35,505 INFO L87 Difference]: Start difference. First operand 789 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:05:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:35,713 INFO L93 Difference]: Finished difference Result 1411 states and 4944 transitions. [2020-01-16 18:05:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:35,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:35,717 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:05:35,717 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:05:35,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:05:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:05:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:05:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:05:35,740 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:05:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:35,740 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:05:35,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:05:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:35,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:35,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:35,742 INFO L426 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2083007633, now seen corresponding path program 274 times [2020-01-16 18:05:35,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:35,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200829598] [2020-01-16 18:05:35,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:36,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200829598] [2020-01-16 18:05:36,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:36,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:36,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745899852] [2020-01-16 18:05:36,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:36,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:36,203 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:05:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:36,378 INFO L93 Difference]: Finished difference Result 1416 states and 4949 transitions. [2020-01-16 18:05:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:36,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:36,382 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:05:36,382 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:05:36,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:05:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:05:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-01-16 18:05:36,416 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-01-16 18:05:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:36,416 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-01-16 18:05:36,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-01-16 18:05:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:36,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:36,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:36,417 INFO L426 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -52759941, now seen corresponding path program 275 times [2020-01-16 18:05:36,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:36,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914207769] [2020-01-16 18:05:36,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:36,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-01-16 18:05:36,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914207769] [2020-01-16 18:05:36,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:36,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:36,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036134367] [2020-01-16 18:05:36,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:36,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:36,873 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:05:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:37,047 INFO L93 Difference]: Finished difference Result 1417 states and 4953 transitions. [2020-01-16 18:05:37,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:37,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:37,051 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:05:37,051 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:05:37,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:05:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 796. [2020-01-16 18:05:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:05:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3161 transitions. [2020-01-16 18:05:37,074 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3161 transitions. Word has length 25 [2020-01-16 18:05:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:37,074 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3161 transitions. [2020-01-16 18:05:37,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3161 transitions. [2020-01-16 18:05:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:37,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:37,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:37,076 INFO L426 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:37,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:37,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2096036595, now seen corresponding path program 276 times [2020-01-16 18:05:37,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:37,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873443501] [2020-01-16 18:05:37,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:37,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-01-16 18:05:37,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873443501] [2020-01-16 18:05:37,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:37,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:37,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116939819] [2020-01-16 18:05:37,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:37,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:37,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:37,538 INFO L87 Difference]: Start difference. First operand 796 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:05:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:37,674 INFO L93 Difference]: Finished difference Result 1420 states and 4952 transitions. [2020-01-16 18:05:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:37,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:37,679 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:05:37,679 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:05:37,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:05:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 784. [2020-01-16 18:05:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:05:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3135 transitions. [2020-01-16 18:05:37,701 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3135 transitions. Word has length 25 [2020-01-16 18:05:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:37,702 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3135 transitions. [2020-01-16 18:05:37,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3135 transitions. [2020-01-16 18:05:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:37,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:37,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:37,703 INFO L426 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash -834877061, now seen corresponding path program 277 times [2020-01-16 18:05:37,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:37,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191285962] [2020-01-16 18:05:37,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:38,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-01-16 18:05:38,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191285962] [2020-01-16 18:05:38,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:38,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:38,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857311310] [2020-01-16 18:05:38,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:38,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:38,150 INFO L87 Difference]: Start difference. First operand 784 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:05:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:38,337 INFO L93 Difference]: Finished difference Result 1395 states and 4906 transitions. [2020-01-16 18:05:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:38,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:38,341 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:05:38,341 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:05:38,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:05:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 791. [2020-01-16 18:05:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-01-16 18:05:38,363 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:38,364 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-01-16 18:05:38,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-01-16 18:05:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:38,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:38,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:38,365 INFO L426 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash 145877657, now seen corresponding path program 278 times [2020-01-16 18:05:38,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:38,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429494898] [2020-01-16 18:05:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:38,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429494898] [2020-01-16 18:05:38,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:38,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:38,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878953936] [2020-01-16 18:05:38,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:38,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:38,827 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:39,033 INFO L93 Difference]: Finished difference Result 1394 states and 4901 transitions. [2020-01-16 18:05:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:39,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:39,037 INFO L225 Difference]: With dead ends: 1394 [2020-01-16 18:05:39,037 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:05:39,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:05:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 788. [2020-01-16 18:05:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-01-16 18:05:39,060 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-01-16 18:05:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:39,060 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-01-16 18:05:39,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-01-16 18:05:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:39,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:39,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:39,061 INFO L426 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 648257877, now seen corresponding path program 279 times [2020-01-16 18:05:39,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:39,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622101008] [2020-01-16 18:05:39,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:39,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622101008] [2020-01-16 18:05:39,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:39,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:39,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141174361] [2020-01-16 18:05:39,516 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:39,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:39,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:39,516 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:05:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:39,690 INFO L93 Difference]: Finished difference Result 1403 states and 4919 transitions. [2020-01-16 18:05:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:39,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:39,694 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:05:39,694 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:05:39,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:05:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 793. [2020-01-16 18:05:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-01-16 18:05:39,716 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-01-16 18:05:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:39,716 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-01-16 18:05:39,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-01-16 18:05:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:39,718 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:39,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:39,718 INFO L426 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1660521907, now seen corresponding path program 280 times [2020-01-16 18:05:39,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:39,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198192125] [2020-01-16 18:05:39,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:40,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198192125] [2020-01-16 18:05:40,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:40,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:40,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486888130] [2020-01-16 18:05:40,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:40,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:40,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:40,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:40,185 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:05:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:40,346 INFO L93 Difference]: Finished difference Result 1408 states and 4924 transitions. [2020-01-16 18:05:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:40,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:40,350 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:05:40,350 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:05:40,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:05:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:05:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:05:40,373 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:05:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:40,373 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:05:40,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:05:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:40,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:40,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] [2020-01-16 18:05:40,374 INFO L426 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1461291515, now seen corresponding path program 281 times [2020-01-16 18:05:40,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:40,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765948438] [2020-01-16 18:05:40,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:40,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-01-16 18:05:40,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765948438] [2020-01-16 18:05:40,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:40,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:40,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945702558] [2020-01-16 18:05:40,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:40,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:40,842 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:05:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:41,030 INFO L93 Difference]: Finished difference Result 1400 states and 4908 transitions. [2020-01-16 18:05:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:41,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:41,034 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:05:41,035 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:05:41,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:05:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:05:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:05:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:05:41,057 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:05:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:41,057 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:05:41,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:05:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:41,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:41,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] [2020-01-16 18:05:41,058 INFO L426 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1999147093, now seen corresponding path program 282 times [2020-01-16 18:05:41,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:41,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146494450] [2020-01-16 18:05:41,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:41,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-01-16 18:05:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146494450] [2020-01-16 18:05:41,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:41,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:41,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404467485] [2020-01-16 18:05:41,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:41,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:41,515 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:05:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:41,648 INFO L93 Difference]: Finished difference Result 1406 states and 4916 transitions. [2020-01-16 18:05:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:41,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:41,652 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:05:41,652 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:05:41,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:05:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-01-16 18:05:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:05:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-01-16 18:05:41,674 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-01-16 18:05:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:41,674 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-01-16 18:05:41,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-01-16 18:05:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:41,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:41,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:41,676 INFO L426 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1933934797, now seen corresponding path program 283 times [2020-01-16 18:05:41,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:41,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026783666] [2020-01-16 18:05:41,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:42,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026783666] [2020-01-16 18:05:42,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:42,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:42,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459290665] [2020-01-16 18:05:42,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:42,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:42,132 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:05:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:42,317 INFO L93 Difference]: Finished difference Result 1403 states and 4920 transitions. [2020-01-16 18:05:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:42,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:42,321 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:05:42,321 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:05:42,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:05:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 791. [2020-01-16 18:05:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:05:42,344 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:05:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:42,344 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:05:42,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:05:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:42,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:42,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:42,345 INFO L426 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash -322993839, now seen corresponding path program 284 times [2020-01-16 18:05:42,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:42,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570032226] [2020-01-16 18:05:42,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:42,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570032226] [2020-01-16 18:05:42,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:42,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:42,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939382618] [2020-01-16 18:05:42,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:42,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:42,797 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:05:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:42,971 INFO L93 Difference]: Finished difference Result 1400 states and 4911 transitions. [2020-01-16 18:05:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:42,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:42,975 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:05:42,975 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:05:42,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:05:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-01-16 18:05:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:05:42,998 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:05:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:42,998 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:05:42,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:05:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:42,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:42,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:42,999 INFO L426 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1854686233, now seen corresponding path program 285 times [2020-01-16 18:05:42,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:43,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736116353] [2020-01-16 18:05:43,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:43,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736116353] [2020-01-16 18:05:43,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:43,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209374255] [2020-01-16 18:05:43,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:43,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:43,451 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:05:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:43,629 INFO L93 Difference]: Finished difference Result 1413 states and 4939 transitions. [2020-01-16 18:05:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:43,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:43,633 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:05:43,633 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:05:43,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:05:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2020-01-16 18:05:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:05:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:05:43,656 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:05:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:43,656 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:05:43,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:05:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:43,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:43,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:43,657 INFO L426 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -291484527, now seen corresponding path program 286 times [2020-01-16 18:05:43,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:43,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471133230] [2020-01-16 18:05:43,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:44,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-01-16 18:05:44,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471133230] [2020-01-16 18:05:44,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:44,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:44,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727893665] [2020-01-16 18:05:44,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:44,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:44,129 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:05:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:44,253 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-01-16 18:05:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:44,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:44,257 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:05:44,257 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:05:44,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:05:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 788. [2020-01-16 18:05:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:05:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:05:44,278 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:05:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:44,279 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:05:44,279 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:05:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:44,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:44,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:44,280 INFO L426 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1865189337, now seen corresponding path program 287 times [2020-01-16 18:05:44,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:44,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831646180] [2020-01-16 18:05:44,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:44,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831646180] [2020-01-16 18:05:44,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:44,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:44,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086064257] [2020-01-16 18:05:44,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:44,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:44,742 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:05:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:44,930 INFO L93 Difference]: Finished difference Result 1404 states and 4914 transitions. [2020-01-16 18:05:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:44,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:44,934 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:05:44,934 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:05:44,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:05:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 792. [2020-01-16 18:05:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:05:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:05:44,968 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:05:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:44,968 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:05:44,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:05:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:44,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:44,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:44,970 INFO L426 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922381, now seen corresponding path program 288 times [2020-01-16 18:05:44,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:44,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223076165] [2020-01-16 18:05:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:45,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223076165] [2020-01-16 18:05:45,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:45,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:45,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475227338] [2020-01-16 18:05:45,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:45,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:45,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:45,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:45,439 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:05:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:45,601 INFO L93 Difference]: Finished difference Result 1410 states and 4922 transitions. [2020-01-16 18:05:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:45,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:45,605 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:05:45,605 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:05:45,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:05:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 780. [2020-01-16 18:05:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:05:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3120 transitions. [2020-01-16 18:05:45,628 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3120 transitions. Word has length 25 [2020-01-16 18:05:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:45,628 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3120 transitions. [2020-01-16 18:05:45,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3120 transitions. [2020-01-16 18:05:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:45,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:45,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] [2020-01-16 18:05:45,630 INFO L426 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1954716373, now seen corresponding path program 289 times [2020-01-16 18:05:45,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:45,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795201818] [2020-01-16 18:05:45,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:46,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795201818] [2020-01-16 18:05:46,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:46,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:46,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939491682] [2020-01-16 18:05:46,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:46,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:46,085 INFO L87 Difference]: Start difference. First operand 780 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:05:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:46,277 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-01-16 18:05:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:46,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:46,281 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:05:46,281 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:05:46,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:05:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:05:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:05:46,303 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:05:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:46,304 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:05:46,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:05:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:46,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:46,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:46,305 INFO L426 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1369999309, now seen corresponding path program 290 times [2020-01-16 18:05:46,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:46,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242544535] [2020-01-16 18:05:46,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:46,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242544535] [2020-01-16 18:05:46,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:46,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:46,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230258085] [2020-01-16 18:05:46,748 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:46,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:46,749 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:05:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:46,947 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-01-16 18:05:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:46,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:46,951 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:05:46,951 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:05:46,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:05:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:05:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:05:46,973 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:46,973 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:05:46,974 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:05:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:46,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:46,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:46,975 INFO L426 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -857115985, now seen corresponding path program 291 times [2020-01-16 18:05:46,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:46,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369253404] [2020-01-16 18:05:46,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:47,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369253404] [2020-01-16 18:05:47,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:47,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000247235] [2020-01-16 18:05:47,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:47,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:47,442 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:47,630 INFO L93 Difference]: Finished difference Result 1410 states and 4957 transitions. [2020-01-16 18:05:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:47,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:47,634 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:05:47,634 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:05:47,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:05:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 793. [2020-01-16 18:05:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:05:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:05:47,656 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:05:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:47,656 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:05:47,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:05:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:47,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05: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] [2020-01-16 18:05:47,658 INFO L426 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 144644941, now seen corresponding path program 292 times [2020-01-16 18:05:47,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:47,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365584382] [2020-01-16 18:05:47,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:48,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-01-16 18:05:48,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365584382] [2020-01-16 18:05:48,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:48,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:48,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715833256] [2020-01-16 18:05:48,121 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:48,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:48,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:48,122 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:05:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:48,314 INFO L93 Difference]: Finished difference Result 1411 states and 4955 transitions. [2020-01-16 18:05:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:48,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:48,319 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:05:48,319 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:05:48,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:05:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:05:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:05:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-01-16 18:05:48,343 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-01-16 18:05:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:48,343 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-01-16 18:05:48,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-01-16 18:05:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:48,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:48,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:48,344 INFO L426 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash -380181675, now seen corresponding path program 293 times [2020-01-16 18:05:48,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:48,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158510750] [2020-01-16 18:05:48,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:48,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158510750] [2020-01-16 18:05:48,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:48,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:48,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264589429] [2020-01-16 18:05:48,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:48,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:48,798 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:05:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:48,953 INFO L93 Difference]: Finished difference Result 1415 states and 4964 transitions. [2020-01-16 18:05:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:48,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:48,957 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:05:48,957 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:05:48,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:05:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 794. [2020-01-16 18:05:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:05:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-01-16 18:05:48,989 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-01-16 18:05:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:48,989 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-01-16 18:05:48,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-01-16 18:05:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:48,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:48,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] [2020-01-16 18:05:48,991 INFO L426 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash 157673903, now seen corresponding path program 294 times [2020-01-16 18:05:48,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:48,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974083921] [2020-01-16 18:05:48,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:49,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974083921] [2020-01-16 18:05:49,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:49,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:49,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728212414] [2020-01-16 18:05:49,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:49,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:49,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:49,460 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:05:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:49,649 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-01-16 18:05:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:49,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:49,653 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:05:49,653 INFO L226 Difference]: Without dead ends: 1391 [2020-01-16 18:05:49,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-01-16 18:05:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 785. [2020-01-16 18:05:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:05:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3139 transitions. [2020-01-16 18:05:49,675 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3139 transitions. Word has length 25 [2020-01-16 18:05:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:49,675 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3139 transitions. [2020-01-16 18:05:49,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3139 transitions. [2020-01-16 18:05:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:49,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:49,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] [2020-01-16 18:05:49,676 INFO L426 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1532230647, now seen corresponding path program 295 times [2020-01-16 18:05:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:49,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978140942] [2020-01-16 18:05:49,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:50,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978140942] [2020-01-16 18:05:50,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:50,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:50,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369249844] [2020-01-16 18:05:50,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:50,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:50,118 INFO L87 Difference]: Start difference. First operand 785 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:05:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:50,307 INFO L93 Difference]: Finished difference Result 1419 states and 4976 transitions. [2020-01-16 18:05:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:50,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:50,311 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:05:50,311 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:05:50,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:05:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:05:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:05:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-01-16 18:05:50,333 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-01-16 18:05:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:50,333 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-01-16 18:05:50,333 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-01-16 18:05:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:50,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:50,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:50,335 INFO L426 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1792485035, now seen corresponding path program 296 times [2020-01-16 18:05:50,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:50,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848316679] [2020-01-16 18:05:50,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:50,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848316679] [2020-01-16 18:05:50,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:50,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:50,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275534983] [2020-01-16 18:05:50,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:50,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:50,777 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:05:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:50,954 INFO L93 Difference]: Finished difference Result 1421 states and 4976 transitions. [2020-01-16 18:05:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:50,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:50,958 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:05:50,959 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:05:50,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:05:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:05:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-01-16 18:05:50,981 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-01-16 18:05:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:50,981 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-01-16 18:05:50,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-01-16 18:05:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:50,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:50,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] [2020-01-16 18:05:50,982 INFO L426 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash 646432367, now seen corresponding path program 297 times [2020-01-16 18:05:50,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:50,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017410823] [2020-01-16 18:05:50,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:51,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017410823] [2020-01-16 18:05:51,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:51,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:51,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770012075] [2020-01-16 18:05:51,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:51,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:51,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:51,447 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:05:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:51,641 INFO L93 Difference]: Finished difference Result 1423 states and 4979 transitions. [2020-01-16 18:05:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:51,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:51,645 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:05:51,645 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:05:51,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:05:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 795. [2020-01-16 18:05:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:05:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3162 transitions. [2020-01-16 18:05:51,668 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3162 transitions. Word has length 25 [2020-01-16 18:05:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:51,668 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3162 transitions. [2020-01-16 18:05:51,668 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3162 transitions. [2020-01-16 18:05:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:51,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:51,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:51,669 INFO L426 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:51,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1658696397, now seen corresponding path program 298 times [2020-01-16 18:05:51,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:51,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942064361] [2020-01-16 18:05:51,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:52,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942064361] [2020-01-16 18:05:52,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:52,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:52,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051401146] [2020-01-16 18:05:52,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:52,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:52,134 INFO L87 Difference]: Start difference. First operand 795 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:05:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:52,281 INFO L93 Difference]: Finished difference Result 1428 states and 4984 transitions. [2020-01-16 18:05:52,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:52,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:52,285 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:05:52,285 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:05:52,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:05:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 790. [2020-01-16 18:05:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:05:52,310 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:05:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:52,310 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:05:52,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:05:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:52,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:52,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:52,311 INFO L426 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -477071177, now seen corresponding path program 299 times [2020-01-16 18:05:52,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:52,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776167870] [2020-01-16 18:05:52,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:52,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776167870] [2020-01-16 18:05:52,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:52,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:52,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530959094] [2020-01-16 18:05:52,782 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:52,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:52,782 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:05:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:52,954 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:05:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:52,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:52,958 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:05:52,959 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:05:52,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:05:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 797. [2020-01-16 18:05:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:05:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:05:52,981 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:05:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:52,981 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:05:52,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:05:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:52,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:52,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] [2020-01-16 18:05:52,982 INFO L426 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1671725359, now seen corresponding path program 300 times [2020-01-16 18:05:52,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:52,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631275923] [2020-01-16 18:05:52,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:53,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631275923] [2020-01-16 18:05:53,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:53,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:53,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597555721] [2020-01-16 18:05:53,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:53,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:53,448 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:05:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:53,599 INFO L93 Difference]: Finished difference Result 1432 states and 4987 transitions. [2020-01-16 18:05:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:53,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:53,602 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:05:53,602 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:05:53,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:05:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 785. [2020-01-16 18:05:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:05:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3134 transitions. [2020-01-16 18:05:53,623 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3134 transitions. Word has length 25 [2020-01-16 18:05:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:53,623 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3134 transitions. [2020-01-16 18:05:53,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3134 transitions. [2020-01-16 18:05:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:53,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:53,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:53,625 INFO L426 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1747908407, now seen corresponding path program 301 times [2020-01-16 18:05:53,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:53,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214342609] [2020-01-16 18:05:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:54,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214342609] [2020-01-16 18:05:54,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:54,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:54,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539063592] [2020-01-16 18:05:54,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:54,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:54,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:54,083 INFO L87 Difference]: Start difference. First operand 785 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:05:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:54,267 INFO L93 Difference]: Finished difference Result 1416 states and 4964 transitions. [2020-01-16 18:05:54,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:54,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:54,271 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:05:54,271 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:05:54,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:05:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 794. [2020-01-16 18:05:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:05:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-01-16 18:05:54,293 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-01-16 18:05:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:54,293 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-01-16 18:05:54,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-01-16 18:05:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:54,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:54,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:54,295 INFO L426 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1545297963, now seen corresponding path program 302 times [2020-01-16 18:05:54,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:54,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142895230] [2020-01-16 18:05:54,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:54,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142895230] [2020-01-16 18:05:54,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:54,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:54,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668591291] [2020-01-16 18:05:54,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:54,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:54,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:54,757 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:05:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:54,914 INFO L93 Difference]: Finished difference Result 1417 states and 4962 transitions. [2020-01-16 18:05:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:54,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:54,918 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:05:54,919 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:05:54,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:05:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:05:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-01-16 18:05:54,941 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-01-16 18:05:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:54,941 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-01-16 18:05:54,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-01-16 18:05:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:54,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:54,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:54,942 INFO L426 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -621024811, now seen corresponding path program 303 times [2020-01-16 18:05:54,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:54,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052624594] [2020-01-16 18:05:54,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:55,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052624594] [2020-01-16 18:05:55,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:55,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:55,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489694195] [2020-01-16 18:05:55,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:55,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:55,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:55,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:55,397 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:05:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:55,554 INFO L93 Difference]: Finished difference Result 1421 states and 4969 transitions. [2020-01-16 18:05:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:55,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:55,558 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:05:55,558 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:05:55,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:05:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-01-16 18:05:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:05:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-01-16 18:05:55,580 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-01-16 18:05:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:55,580 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-01-16 18:05:55,580 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-01-16 18:05:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:55,581 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:55,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:55,582 INFO L426 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 391239219, now seen corresponding path program 304 times [2020-01-16 18:05:55,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:55,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047285113] [2020-01-16 18:05:55,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:56,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-01-16 18:05:56,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047285113] [2020-01-16 18:05:56,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:56,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:56,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692266291] [2020-01-16 18:05:56,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:56,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:56,042 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:05:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:56,179 INFO L93 Difference]: Finished difference Result 1426 states and 4974 transitions. [2020-01-16 18:05:56,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:56,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:56,183 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:05:56,183 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:05:56,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:05:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:05:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:05:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-01-16 18:05:56,205 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-01-16 18:05:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:56,206 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-01-16 18:05:56,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-01-16 18:05:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:56,207 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:56,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:56,207 INFO L426 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash -229884105, now seen corresponding path program 305 times [2020-01-16 18:05:56,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:56,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842313260] [2020-01-16 18:05:56,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:56,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842313260] [2020-01-16 18:05:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:56,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:56,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852882938] [2020-01-16 18:05:56,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:56,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:56,671 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:05:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:56,885 INFO L93 Difference]: Finished difference Result 1424 states and 4971 transitions. [2020-01-16 18:05:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:56,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:56,890 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:05:56,890 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:05:56,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:05:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 796. [2020-01-16 18:05:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:05:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-01-16 18:05:56,913 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-01-16 18:05:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:56,913 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-01-16 18:05:56,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-01-16 18:05:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:56,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:56,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:56,914 INFO L426 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:56,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:56,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1381056853, now seen corresponding path program 306 times [2020-01-16 18:05:56,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:56,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183059077] [2020-01-16 18:05:56,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:57,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183059077] [2020-01-16 18:05:57,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:57,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:57,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613362310] [2020-01-16 18:05:57,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:57,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:57,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:57,382 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:05:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:57,545 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:05:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:57,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:57,549 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:05:57,549 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:05:57,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:05:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 785. [2020-01-16 18:05:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:05:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-01-16 18:05:57,571 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-01-16 18:05:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:57,571 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-01-16 18:05:57,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-01-16 18:05:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:57,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:57,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] [2020-01-16 18:05:57,572 INFO L426 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1742942259, now seen corresponding path program 307 times [2020-01-16 18:05:57,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:57,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860634314] [2020-01-16 18:05:57,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:58,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860634314] [2020-01-16 18:05:58,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:58,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:58,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791189189] [2020-01-16 18:05:58,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:58,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:58,055 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:05:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:58,218 INFO L93 Difference]: Finished difference Result 1427 states and 4987 transitions. [2020-01-16 18:05:58,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:58,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:58,221 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:05:58,221 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:05:58,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:05:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 796. [2020-01-16 18:05:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:05:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3160 transitions. [2020-01-16 18:05:58,245 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3160 transitions. Word has length 25 [2020-01-16 18:05:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:58,245 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3160 transitions. [2020-01-16 18:05:58,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3160 transitions. [2020-01-16 18:05:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:58,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:58,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:58,246 INFO L426 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2014169459, now seen corresponding path program 308 times [2020-01-16 18:05:58,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:58,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480998685] [2020-01-16 18:05:58,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:58,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480998685] [2020-01-16 18:05:58,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:58,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:58,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913996475] [2020-01-16 18:05:58,711 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:58,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:58,712 INFO L87 Difference]: Start difference. First operand 796 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:05:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:58,922 INFO L93 Difference]: Finished difference Result 1426 states and 4980 transitions. [2020-01-16 18:05:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:58,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:58,926 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:05:58,926 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:05:58,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:05:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 791. [2020-01-16 18:05:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:05:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:05:58,949 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:05:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:58,949 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:05:58,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:05:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:58,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:58,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:05:58,950 INFO L426 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash 142504405, now seen corresponding path program 309 times [2020-01-16 18:05:58,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:58,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391109708] [2020-01-16 18:05:58,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:05:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:05:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391109708] [2020-01-16 18:05:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:05:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:05:59,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363747496] [2020-01-16 18:05:59,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:05:59,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:05:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:05:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:05:59,416 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:05:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:05:59,607 INFO L93 Difference]: Finished difference Result 1433 states and 4994 transitions. [2020-01-16 18:05:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:05:59,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:05:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:05:59,611 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:05:59,611 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:05:59,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:05:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:05:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 798. [2020-01-16 18:05:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:05:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3159 transitions. [2020-01-16 18:05:59,634 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3159 transitions. Word has length 25 [2020-01-16 18:05:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:05:59,634 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3159 transitions. [2020-01-16 18:05:59,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:05:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3159 transitions. [2020-01-16 18:05:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:05:59,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:05:59,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] [2020-01-16 18:05:59,635 INFO L426 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:05:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:05:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2003666355, now seen corresponding path program 310 times [2020-01-16 18:05:59,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:05:59,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417278758] [2020-01-16 18:05:59,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:05:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:00,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-01-16 18:06:00,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417278758] [2020-01-16 18:06:00,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:00,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:00,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304708316] [2020-01-16 18:06:00,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:00,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:00,099 INFO L87 Difference]: Start difference. First operand 798 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:06:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:00,283 INFO L93 Difference]: Finished difference Result 1436 states and 4993 transitions. [2020-01-16 18:06:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:00,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:00,288 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:06:00,288 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:06:00,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:06:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-01-16 18:06:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-01-16 18:06:00,310 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-01-16 18:06:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:00,310 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-01-16 18:06:00,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-01-16 18:06:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:00,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:00,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:00,312 INFO L426 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 174013717, now seen corresponding path program 311 times [2020-01-16 18:06:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:00,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542091130] [2020-01-16 18:06:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:00,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542091130] [2020-01-16 18:06:00,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:00,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:00,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986704972] [2020-01-16 18:06:00,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:00,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:00,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:00,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:00,768 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:06:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:00,984 INFO L93 Difference]: Finished difference Result 1430 states and 4981 transitions. [2020-01-16 18:06:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:00,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:00,988 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:06:00,988 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:06:00,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:06:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-01-16 18:06:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3151 transitions. [2020-01-16 18:06:01,010 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3151 transitions. Word has length 25 [2020-01-16 18:06:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:01,011 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3151 transitions. [2020-01-16 18:06:01,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3151 transitions. [2020-01-16 18:06:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:01,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:01,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:01,012 INFO L426 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1784954675, now seen corresponding path program 312 times [2020-01-16 18:06:01,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:01,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37733903] [2020-01-16 18:06:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:01,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37733903] [2020-01-16 18:06:01,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:01,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:01,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277456605] [2020-01-16 18:06:01,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:01,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:01,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:01,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:01,482 INFO L87 Difference]: Start difference. First operand 797 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:06:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:01,674 INFO L93 Difference]: Finished difference Result 1434 states and 4983 transitions. [2020-01-16 18:06:01,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:01,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:01,678 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:06:01,678 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:06:01,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:06:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 780. [2020-01-16 18:06:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:06:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3116 transitions. [2020-01-16 18:06:01,700 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3116 transitions. Word has length 25 [2020-01-16 18:06:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:01,700 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3116 transitions. [2020-01-16 18:06:01,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3116 transitions. [2020-01-16 18:06:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:01,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:01,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] [2020-01-16 18:06:01,701 INFO L426 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1048858189, now seen corresponding path program 313 times [2020-01-16 18:06:01,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:01,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97414391] [2020-01-16 18:06:01,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:02,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97414391] [2020-01-16 18:06:02,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:02,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:02,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979736668] [2020-01-16 18:06:02,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:02,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:02,163 INFO L87 Difference]: Start difference. First operand 780 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:06:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:02,367 INFO L93 Difference]: Finished difference Result 1386 states and 4886 transitions. [2020-01-16 18:06:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:02,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:02,382 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:06:02,382 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:06:02,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:06:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 790. [2020-01-16 18:06:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-01-16 18:06:02,403 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-01-16 18:06:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:02,403 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-01-16 18:06:02,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-01-16 18:06:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:02,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:02,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:02,405 INFO L426 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash -68103471, now seen corresponding path program 314 times [2020-01-16 18:06:02,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:02,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415765292] [2020-01-16 18:06:02,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415765292] [2020-01-16 18:06:02,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:02,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:02,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605636489] [2020-01-16 18:06:02,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:02,867 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:06:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:03,077 INFO L93 Difference]: Finished difference Result 1385 states and 4881 transitions. [2020-01-16 18:06:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:03,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:03,081 INFO L225 Difference]: With dead ends: 1385 [2020-01-16 18:06:03,081 INFO L226 Difference]: Without dead ends: 1370 [2020-01-16 18:06:03,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-01-16 18:06:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-01-16 18:06:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:06:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3142 transitions. [2020-01-16 18:06:03,103 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3142 transitions. Word has length 25 [2020-01-16 18:06:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:03,103 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3142 transitions. [2020-01-16 18:06:03,103 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3142 transitions. [2020-01-16 18:06:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:03,104 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:03,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:03,105 INFO L426 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:03,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1491757329, now seen corresponding path program 315 times [2020-01-16 18:06:03,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:03,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442015585] [2020-01-16 18:06:03,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:03,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442015585] [2020-01-16 18:06:03,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:03,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:03,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646519225] [2020-01-16 18:06:03,565 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:03,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:03,566 INFO L87 Difference]: Start difference. First operand 787 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:06:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:03,729 INFO L93 Difference]: Finished difference Result 1389 states and 4890 transitions. [2020-01-16 18:06:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:03,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:03,733 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:06:03,733 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:06:03,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:06:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-01-16 18:06:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-01-16 18:06:03,755 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-01-16 18:06:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:03,755 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-01-16 18:06:03,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-01-16 18:06:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:03,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:03,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] [2020-01-16 18:06:03,757 INFO L426 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -489996403, now seen corresponding path program 316 times [2020-01-16 18:06:03,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:03,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476728248] [2020-01-16 18:06:03,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:04,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-01-16 18:06:04,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476728248] [2020-01-16 18:06:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:04,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423586432] [2020-01-16 18:06:04,210 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:04,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:04,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:04,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:04,210 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:06:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:04,419 INFO L93 Difference]: Finished difference Result 1390 states and 4888 transitions. [2020-01-16 18:06:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:04,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:04,424 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:06:04,424 INFO L226 Difference]: Without dead ends: 1372 [2020-01-16 18:06:04,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-01-16 18:06:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-01-16 18:06:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:06:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3139 transitions. [2020-01-16 18:06:04,446 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3139 transitions. Word has length 25 [2020-01-16 18:06:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:04,446 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3139 transitions. [2020-01-16 18:06:04,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3139 transitions. [2020-01-16 18:06:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:04,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:04,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:04,447 INFO L426 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 921714163, now seen corresponding path program 317 times [2020-01-16 18:06:04,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:04,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555008598] [2020-01-16 18:06:04,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:04,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555008598] [2020-01-16 18:06:04,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:04,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:04,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920861809] [2020-01-16 18:06:04,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:04,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:04,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:04,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:04,905 INFO L87 Difference]: Start difference. First operand 787 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:06:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:05,116 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-01-16 18:06:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:05,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:05,120 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:06:05,120 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:06:05,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:06:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-01-16 18:06:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3144 transitions. [2020-01-16 18:06:05,142 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3144 transitions. Word has length 25 [2020-01-16 18:06:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:05,142 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3144 transitions. [2020-01-16 18:06:05,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3144 transitions. [2020-01-16 18:06:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:05,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:05,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:05,143 INFO L426 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash -151371217, now seen corresponding path program 318 times [2020-01-16 18:06:05,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:05,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431805538] [2020-01-16 18:06:05,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:05,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431805538] [2020-01-16 18:06:05,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:05,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:05,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177556328] [2020-01-16 18:06:05,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:05,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:05,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:05,594 INFO L87 Difference]: Start difference. First operand 790 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:06:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:05,804 INFO L93 Difference]: Finished difference Result 1388 states and 4881 transitions. [2020-01-16 18:06:05,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:05,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:05,808 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:06:05,808 INFO L226 Difference]: Without dead ends: 1368 [2020-01-16 18:06:05,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-01-16 18:06:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 784. [2020-01-16 18:06:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-01-16 18:06:05,831 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-01-16 18:06:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:05,831 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-01-16 18:06:05,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-01-16 18:06:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:05,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:05,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:05,832 INFO L426 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1471343915, now seen corresponding path program 319 times [2020-01-16 18:06:05,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:05,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337212057] [2020-01-16 18:06:05,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:06,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337212057] [2020-01-16 18:06:06,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:06,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:06,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004344409] [2020-01-16 18:06:06,289 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:06,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:06,290 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:06:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:06,463 INFO L93 Difference]: Finished difference Result 1393 states and 4897 transitions. [2020-01-16 18:06:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:06,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:06,467 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:06:06,467 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:06:06,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:06:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-01-16 18:06:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-01-16 18:06:06,489 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-01-16 18:06:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:06,489 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-01-16 18:06:06,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-01-16 18:06:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:06,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:06,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:06,491 INFO L426 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -490589197, now seen corresponding path program 320 times [2020-01-16 18:06:06,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:06,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279918632] [2020-01-16 18:06:06,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:06,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279918632] [2020-01-16 18:06:06,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:06,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:06,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178871684] [2020-01-16 18:06:06,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:06,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:06,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:06,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:06,954 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:06:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:07,165 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-01-16 18:06:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:07,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:07,169 INFO L225 Difference]: With dead ends: 1392 [2020-01-16 18:06:07,169 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:06:07,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:06:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 788. [2020-01-16 18:06:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-01-16 18:06:07,191 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-01-16 18:06:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:07,191 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-01-16 18:06:07,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-01-16 18:06:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:07,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:07,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:07,192 INFO L426 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:07,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash 11791023, now seen corresponding path program 321 times [2020-01-16 18:06:07,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:07,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293400579] [2020-01-16 18:06:07,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:07,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293400579] [2020-01-16 18:06:07,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:07,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377041861] [2020-01-16 18:06:07,653 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:07,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:07,653 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:06:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:07,820 INFO L93 Difference]: Finished difference Result 1401 states and 4910 transitions. [2020-01-16 18:06:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:07,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:07,824 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:06:07,824 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:06:07,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:06:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 793. [2020-01-16 18:06:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3151 transitions. [2020-01-16 18:06:07,846 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3151 transitions. Word has length 25 [2020-01-16 18:06:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:07,846 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3151 transitions. [2020-01-16 18:06:07,846 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3151 transitions. [2020-01-16 18:06:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:07,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:07,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] [2020-01-16 18:06:07,847 INFO L426 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1024055053, now seen corresponding path program 322 times [2020-01-16 18:06:07,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:07,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368387940] [2020-01-16 18:06:07,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:08,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368387940] [2020-01-16 18:06:08,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:08,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:08,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474441412] [2020-01-16 18:06:08,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:08,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:08,307 INFO L87 Difference]: Start difference. First operand 793 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:06:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:08,488 INFO L93 Difference]: Finished difference Result 1406 states and 4915 transitions. [2020-01-16 18:06:08,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:08,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:08,492 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:06:08,492 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:06:08,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:06:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:06:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:06:08,514 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:06:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:08,514 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:06:08,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:06:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:08,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:08,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:08,515 INFO L426 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 824824661, now seen corresponding path program 323 times [2020-01-16 18:06:08,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:08,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15386980] [2020-01-16 18:06:08,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15386980] [2020-01-16 18:06:08,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:08,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:08,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388700308] [2020-01-16 18:06:08,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:08,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:08,965 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:06:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:09,173 INFO L93 Difference]: Finished difference Result 1398 states and 4899 transitions. [2020-01-16 18:06:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:09,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:09,176 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:06:09,176 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:06:09,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:06:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-01-16 18:06:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:06:09,198 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:06:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:09,198 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:06:09,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:06:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:09,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:09,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:09,200 INFO L426 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1362680239, now seen corresponding path program 324 times [2020-01-16 18:06:09,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:09,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755511385] [2020-01-16 18:06:09,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:09,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755511385] [2020-01-16 18:06:09,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:09,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:09,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431465088] [2020-01-16 18:06:09,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:09,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:09,660 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:06:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:09,838 INFO L93 Difference]: Finished difference Result 1404 states and 4907 transitions. [2020-01-16 18:06:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:09,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:09,842 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:06:09,842 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:06:09,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:06:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 784. [2020-01-16 18:06:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:06:09,864 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:06:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:09,864 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:06:09,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:06:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:09,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:09,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:09,865 INFO L426 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1535752789, now seen corresponding path program 325 times [2020-01-16 18:06:09,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:09,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487052409] [2020-01-16 18:06:09,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:10,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487052409] [2020-01-16 18:06:10,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:10,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:10,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461470920] [2020-01-16 18:06:10,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:10,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:10,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:10,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:10,316 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:06:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:10,524 INFO L93 Difference]: Finished difference Result 1402 states and 4917 transitions. [2020-01-16 18:06:10,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:10,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:10,527 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:06:10,528 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:06:10,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:06:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-01-16 18:06:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:06:10,549 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:06:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:10,549 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:06:10,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:06:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:10,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:10,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:10,551 INFO L426 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1757453581, now seen corresponding path program 326 times [2020-01-16 18:06:10,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:10,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191554510] [2020-01-16 18:06:10,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:11,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191554510] [2020-01-16 18:06:11,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:11,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:11,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277933226] [2020-01-16 18:06:11,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:11,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:11,009 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:06:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:11,158 INFO L93 Difference]: Finished difference Result 1403 states and 4915 transitions. [2020-01-16 18:06:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:11,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:11,162 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:06:11,162 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:06:11,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:06:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 789. [2020-01-16 18:06:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:06:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-01-16 18:06:11,184 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-01-16 18:06:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:11,184 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-01-16 18:06:11,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-01-16 18:06:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:11,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:11,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] [2020-01-16 18:06:11,185 INFO L426 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -833180429, now seen corresponding path program 327 times [2020-01-16 18:06:11,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:11,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400620] [2020-01-16 18:06:11,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:11,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400620] [2020-01-16 18:06:11,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:11,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:11,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3132124] [2020-01-16 18:06:11,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:11,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:11,652 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:06:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:11,796 INFO L93 Difference]: Finished difference Result 1407 states and 4922 transitions. [2020-01-16 18:06:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:11,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:11,799 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:06:11,799 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:06:11,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:06:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 794. [2020-01-16 18:06:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:06:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3150 transitions. [2020-01-16 18:06:11,822 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3150 transitions. Word has length 25 [2020-01-16 18:06:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:11,822 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3150 transitions. [2020-01-16 18:06:11,822 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3150 transitions. [2020-01-16 18:06:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:11,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:11,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:11,824 INFO L426 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 179083601, now seen corresponding path program 328 times [2020-01-16 18:06:11,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:11,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333867113] [2020-01-16 18:06:11,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:12,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-01-16 18:06:12,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333867113] [2020-01-16 18:06:12,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:12,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:12,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000428833] [2020-01-16 18:06:12,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:12,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:12,309 INFO L87 Difference]: Start difference. First operand 794 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:06:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:12,426 INFO L93 Difference]: Finished difference Result 1412 states and 4927 transitions. [2020-01-16 18:06:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:12,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:12,430 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:06:12,430 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:06:12,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:06:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 789. [2020-01-16 18:06:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:06:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-01-16 18:06:12,452 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-01-16 18:06:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:12,452 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-01-16 18:06:12,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-01-16 18:06:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:12,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:12,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:12,454 INFO L426 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -442039723, now seen corresponding path program 329 times [2020-01-16 18:06:12,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:12,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168488281] [2020-01-16 18:06:12,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:12,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168488281] [2020-01-16 18:06:12,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:12,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029059604] [2020-01-16 18:06:12,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:12,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:12,902 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:06:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:13,045 INFO L93 Difference]: Finished difference Result 1410 states and 4924 transitions. [2020-01-16 18:06:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:13,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:13,049 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:06:13,050 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:06:13,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:06:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 795. [2020-01-16 18:06:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:06:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3147 transitions. [2020-01-16 18:06:13,072 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3147 transitions. Word has length 25 [2020-01-16 18:06:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:13,072 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3147 transitions. [2020-01-16 18:06:13,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3147 transitions. [2020-01-16 18:06:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:13,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:13,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:13,073 INFO L426 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1168901235, now seen corresponding path program 330 times [2020-01-16 18:06:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:13,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659892032] [2020-01-16 18:06:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:13,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659892032] [2020-01-16 18:06:13,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:13,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:13,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379732117] [2020-01-16 18:06:13,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:13,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:13,527 INFO L87 Difference]: Start difference. First operand 795 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:06:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:13,647 INFO L93 Difference]: Finished difference Result 1414 states and 4926 transitions. [2020-01-16 18:06:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:13,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:13,651 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:06:13,651 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:06:13,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:06:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 784. [2020-01-16 18:06:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-01-16 18:06:13,673 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-01-16 18:06:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:13,673 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-01-16 18:06:13,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-01-16 18:06:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:13,674 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:13,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:13,675 INFO L426 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1250129199, now seen corresponding path program 331 times [2020-01-16 18:06:13,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:13,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268133527] [2020-01-16 18:06:13,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:14,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-01-16 18:06:14,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268133527] [2020-01-16 18:06:14,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:14,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:14,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871311167] [2020-01-16 18:06:14,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:14,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:14,112 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:06:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:14,263 INFO L93 Difference]: Finished difference Result 1395 states and 4894 transitions. [2020-01-16 18:06:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:14,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:14,266 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:06:14,267 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:06:14,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:06:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-01-16 18:06:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3142 transitions. [2020-01-16 18:06:14,289 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3142 transitions. Word has length 25 [2020-01-16 18:06:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:14,289 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3142 transitions. [2020-01-16 18:06:14,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3142 transitions. [2020-01-16 18:06:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:14,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:14,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:14,291 INFO L426 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752717, now seen corresponding path program 332 times [2020-01-16 18:06:14,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:14,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192408383] [2020-01-16 18:06:14,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:14,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-01-16 18:06:14,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192408383] [2020-01-16 18:06:14,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:14,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:14,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604066888] [2020-01-16 18:06:14,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:14,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:14,738 INFO L87 Difference]: Start difference. First operand 791 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:06:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:14,881 INFO L93 Difference]: Finished difference Result 1397 states and 4895 transitions. [2020-01-16 18:06:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:14,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:14,885 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:06:14,885 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:06:14,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:06:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-01-16 18:06:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:06:14,908 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:06:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:14,908 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:06:14,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:06:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:14,910 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:14,910 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:14,910 INFO L426 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1444400243, now seen corresponding path program 333 times [2020-01-16 18:06:14,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:14,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224497744] [2020-01-16 18:06:14,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:15,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-01-16 18:06:15,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224497744] [2020-01-16 18:06:15,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:15,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:15,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106899549] [2020-01-16 18:06:15,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:15,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:15,353 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:06:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:15,504 INFO L93 Difference]: Finished difference Result 1400 states and 4900 transitions. [2020-01-16 18:06:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:15,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:15,509 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:06:15,509 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:06:15,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:06:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:06:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:06:15,531 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:06:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:15,531 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:06:15,531 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:06:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:15,532 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:15,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:15,533 INFO L426 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1982255821, now seen corresponding path program 334 times [2020-01-16 18:06:15,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:15,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840615444] [2020-01-16 18:06:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:15,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840615444] [2020-01-16 18:06:15,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:15,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:15,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405619137] [2020-01-16 18:06:15,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:15,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:15,977 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:06:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:16,093 INFO L93 Difference]: Finished difference Result 1406 states and 4908 transitions. [2020-01-16 18:06:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:16,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:16,097 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:06:16,097 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:06:16,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:06:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 788. [2020-01-16 18:06:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-01-16 18:06:16,120 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-01-16 18:06:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:16,120 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-01-16 18:06:16,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-01-16 18:06:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:16,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:16,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:16,121 INFO L426 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1465406451, now seen corresponding path program 335 times [2020-01-16 18:06:16,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:16,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669218917] [2020-01-16 18:06:16,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:16,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-01-16 18:06:16,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669218917] [2020-01-16 18:06:16,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:16,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:16,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205724039] [2020-01-16 18:06:16,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:16,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:16,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:16,562 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:06:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:16,710 INFO L93 Difference]: Finished difference Result 1406 states and 4910 transitions. [2020-01-16 18:06:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:16,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:16,714 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:06:16,714 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:06:16,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:06:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 794. [2020-01-16 18:06:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:06:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-01-16 18:06:16,737 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-01-16 18:06:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:16,737 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-01-16 18:06:16,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-01-16 18:06:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:16,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:16,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:16,739 INFO L426 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1218619887, now seen corresponding path program 336 times [2020-01-16 18:06:16,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:16,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484560446] [2020-01-16 18:06:16,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:17,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-01-16 18:06:17,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484560446] [2020-01-16 18:06:17,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:17,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:17,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069504967] [2020-01-16 18:06:17,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:17,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:17,189 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:06:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:17,314 INFO L93 Difference]: Finished difference Result 1410 states and 4912 transitions. [2020-01-16 18:06:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:17,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:17,319 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:06:17,319 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:06:17,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:06:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 780. [2020-01-16 18:06:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:06:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:06:17,343 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:06:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:17,343 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:06:17,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:06:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:17,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:17,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:17,345 INFO L426 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:17,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1832995017, now seen corresponding path program 337 times [2020-01-16 18:06:17,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:17,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733414685] [2020-01-16 18:06:17,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:17,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733414685] [2020-01-16 18:06:17,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:17,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:17,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325296323] [2020-01-16 18:06:17,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:17,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:17,795 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:06:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:17,941 INFO L93 Difference]: Finished difference Result 1399 states and 4914 transitions. [2020-01-16 18:06:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:17,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:17,946 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:06:17,946 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:06:17,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:06:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 790. [2020-01-16 18:06:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-01-16 18:06:17,968 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-01-16 18:06:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:17,968 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-01-16 18:06:17,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-01-16 18:06:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:17,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:17,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:17,970 INFO L426 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -222054059, now seen corresponding path program 338 times [2020-01-16 18:06:17,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:17,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239066740] [2020-01-16 18:06:17,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:18,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-01-16 18:06:18,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239066740] [2020-01-16 18:06:18,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:18,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:18,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370780114] [2020-01-16 18:06:18,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:18,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:18,423 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:06:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:18,571 INFO L93 Difference]: Finished difference Result 1396 states and 4905 transitions. [2020-01-16 18:06:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:18,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:18,574 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:06:18,574 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:06:18,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:06:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 787. [2020-01-16 18:06:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:06:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:06:18,596 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:06:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:18,596 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:06:18,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:06:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:18,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:18,598 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:18,598 INFO L426 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -738903429, now seen corresponding path program 339 times [2020-01-16 18:06:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:18,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848653841] [2020-01-16 18:06:18,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:19,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848653841] [2020-01-16 18:06:19,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:19,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:19,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225760075] [2020-01-16 18:06:19,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:19,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:19,048 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:06:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:19,202 INFO L93 Difference]: Finished difference Result 1403 states and 4921 transitions. [2020-01-16 18:06:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:19,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:19,206 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:06:19,206 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:06:19,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:06:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-01-16 18:06:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:06:19,228 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:06:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:19,228 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:06:19,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:06:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:19,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:19,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:19,229 INFO L426 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash -201047851, now seen corresponding path program 340 times [2020-01-16 18:06:19,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:19,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349284451] [2020-01-16 18:06:19,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349284451] [2020-01-16 18:06:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:19,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:19,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021435326] [2020-01-16 18:06:19,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:19,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:19,689 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:06:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:19,836 INFO L93 Difference]: Finished difference Result 1402 states and 4914 transitions. [2020-01-16 18:06:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:19,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:19,839 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:06:19,839 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:06:19,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:06:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 787. [2020-01-16 18:06:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:06:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-01-16 18:06:19,861 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-01-16 18:06:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:19,861 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-01-16 18:06:19,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-01-16 18:06:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:19,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:19,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:19,863 INFO L426 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash -728400325, now seen corresponding path program 341 times [2020-01-16 18:06:19,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:19,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133111361] [2020-01-16 18:06:19,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:20,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133111361] [2020-01-16 18:06:20,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:20,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:20,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928951820] [2020-01-16 18:06:20,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:20,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:20,307 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:06:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:20,452 INFO L93 Difference]: Finished difference Result 1395 states and 4900 transitions. [2020-01-16 18:06:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:20,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:20,456 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:06:20,456 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:06:20,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:06:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 790. [2020-01-16 18:06:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:06:20,479 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:06:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:20,480 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:06:20,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:06:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:20,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:20,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:20,481 INFO L426 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1801485705, now seen corresponding path program 342 times [2020-01-16 18:06:20,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:20,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204223959] [2020-01-16 18:06:20,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:20,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204223959] [2020-01-16 18:06:20,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:20,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:20,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391645998] [2020-01-16 18:06:20,921 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:20,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:20,921 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:06:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:21,083 INFO L93 Difference]: Finished difference Result 1397 states and 4901 transitions. [2020-01-16 18:06:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:21,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:21,087 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:06:21,087 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:06:21,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:06:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 784. [2020-01-16 18:06:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:06:21,109 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:06:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:21,109 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:06:21,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:06:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:21,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:21,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:21,110 INFO L426 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 93039061, now seen corresponding path program 343 times [2020-01-16 18:06:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:21,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445073788] [2020-01-16 18:06:21,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:21,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445073788] [2020-01-16 18:06:21,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:21,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761202487] [2020-01-16 18:06:21,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:21,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:21,557 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:06:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:21,712 INFO L93 Difference]: Finished difference Result 1407 states and 4928 transitions. [2020-01-16 18:06:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:21,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:21,716 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:06:21,716 INFO L226 Difference]: Without dead ends: 1392 [2020-01-16 18:06:21,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-01-16 18:06:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-01-16 18:06:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-01-16 18:06:21,738 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-01-16 18:06:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:21,738 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-01-16 18:06:21,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-01-16 18:06:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:21,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:21,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:21,739 INFO L426 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1703980019, now seen corresponding path program 344 times [2020-01-16 18:06:21,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:21,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240663387] [2020-01-16 18:06:21,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:22,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-01-16 18:06:22,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240663387] [2020-01-16 18:06:22,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:22,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:22,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869336349] [2020-01-16 18:06:22,188 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:22,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:22,189 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:06:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:22,335 INFO L93 Difference]: Finished difference Result 1404 states and 4919 transitions. [2020-01-16 18:06:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:22,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:22,339 INFO L225 Difference]: With dead ends: 1404 [2020-01-16 18:06:22,339 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:06:22,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:06:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-01-16 18:06:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:06:22,361 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:06:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:22,362 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:06:22,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:06:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:22,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:22,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:22,363 INFO L426 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -413307205, now seen corresponding path program 345 times [2020-01-16 18:06:22,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:22,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800154574] [2020-01-16 18:06:22,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06: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-01-16 18:06:22,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800154574] [2020-01-16 18:06:22,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:22,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:22,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551949490] [2020-01-16 18:06:22,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:22,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:22,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:22,809 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:06:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:22,956 INFO L93 Difference]: Finished difference Result 1417 states and 4947 transitions. [2020-01-16 18:06:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:22,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:22,960 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:06:22,960 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:06:22,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:06:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-01-16 18:06:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:06:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:06:22,981 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:06:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:22,982 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:06:22,982 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:06:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:22,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:22,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:22,983 INFO L426 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1735489331, now seen corresponding path program 346 times [2020-01-16 18:06:22,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:22,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951965055] [2020-01-16 18:06:22,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:23,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951965055] [2020-01-16 18:06:23,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:23,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:23,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200839119] [2020-01-16 18:06:23,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:23,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:23,448 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:06:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:23,576 INFO L93 Difference]: Finished difference Result 1420 states and 4946 transitions. [2020-01-16 18:06:23,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:23,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:23,580 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:06:23,580 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:06:23,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:06:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 788. [2020-01-16 18:06:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:06:23,602 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:06:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:23,602 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:06:23,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:06:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:23,603 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:23,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:23,603 INFO L426 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -402804101, now seen corresponding path program 347 times [2020-01-16 18:06:23,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:23,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248246057] [2020-01-16 18:06:23,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:24,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248246057] [2020-01-16 18:06:24,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:24,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:24,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646434799] [2020-01-16 18:06:24,062 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:24,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:24,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:24,062 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:06:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:24,206 INFO L93 Difference]: Finished difference Result 1408 states and 4922 transitions. [2020-01-16 18:06:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:24,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:24,210 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:06:24,210 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:06:24,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:06:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:06:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:06:24,232 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:06:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:24,232 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:06:24,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:06:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:24,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:24,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:24,234 INFO L426 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash 135051477, now seen corresponding path program 348 times [2020-01-16 18:06:24,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:24,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943410238] [2020-01-16 18:06:24,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:24,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943410238] [2020-01-16 18:06:24,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:24,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:24,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351261033] [2020-01-16 18:06:24,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:24,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:24,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:24,727 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:06:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:24,874 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-01-16 18:06:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:24,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:24,878 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:06:24,878 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:06:24,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:06:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 784. [2020-01-16 18:06:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-01-16 18:06:24,900 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-01-16 18:06:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:24,900 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-01-16 18:06:24,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-01-16 18:06:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:24,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:24,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:24,902 INFO L426 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 744231509, now seen corresponding path program 349 times [2020-01-16 18:06:24,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:24,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833663469] [2020-01-16 18:06:24,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:25,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833663469] [2020-01-16 18:06:25,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:25,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:25,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884697871] [2020-01-16 18:06:25,350 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:25,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:25,351 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:06:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:25,508 INFO L93 Difference]: Finished difference Result 1419 states and 4958 transitions. [2020-01-16 18:06:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:25,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:25,513 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:06:25,513 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:06:25,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:06:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-01-16 18:06:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:06:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-01-16 18:06:25,536 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-01-16 18:06:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:25,536 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-01-16 18:06:25,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-01-16 18:06:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:25,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:25,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:25,537 INFO L426 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1282087087, now seen corresponding path program 350 times [2020-01-16 18:06:25,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:25,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242848514] [2020-01-16 18:06:25,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:25,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-01-16 18:06:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242848514] [2020-01-16 18:06:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985501050] [2020-01-16 18:06:25,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:25,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:25,991 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:06:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:26,180 INFO L93 Difference]: Finished difference Result 1418 states and 4951 transitions. [2020-01-16 18:06:26,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:26,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:26,184 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:06:26,184 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:06:26,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:06:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:06:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:06:26,206 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:06:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:26,207 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:06:26,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:06:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:26,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:26,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] [2020-01-16 18:06:26,208 INFO L426 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash -856206345, now seen corresponding path program 351 times [2020-01-16 18:06:26,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:26,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556050461] [2020-01-16 18:06:26,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:26,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-01-16 18:06:26,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556050461] [2020-01-16 18:06:26,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:26,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:26,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963525160] [2020-01-16 18:06:26,667 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:26,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:26,668 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:06:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:26,849 INFO L93 Difference]: Finished difference Result 1425 states and 4965 transitions. [2020-01-16 18:06:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:26,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:26,853 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:06:26,853 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:06:26,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:06:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 797. [2020-01-16 18:06:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3153 transitions. [2020-01-16 18:06:26,875 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3153 transitions. Word has length 25 [2020-01-16 18:06:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:26,875 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3153 transitions. [2020-01-16 18:06:26,875 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3153 transitions. [2020-01-16 18:06:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:26,876 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:26,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:26,876 INFO L426 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1292590191, now seen corresponding path program 352 times [2020-01-16 18:06:26,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:26,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234689598] [2020-01-16 18:06:26,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:27,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234689598] [2020-01-16 18:06:27,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:27,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:27,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444136434] [2020-01-16 18:06:27,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:27,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:27,336 INFO L87 Difference]: Start difference. First operand 797 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:06:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:27,460 INFO L93 Difference]: Finished difference Result 1428 states and 4964 transitions. [2020-01-16 18:06:27,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:27,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:27,464 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:06:27,464 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:06:27,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:06:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-01-16 18:06:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:06:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3134 transitions. [2020-01-16 18:06:27,486 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3134 transitions. Word has length 25 [2020-01-16 18:06:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:27,486 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3134 transitions. [2020-01-16 18:06:27,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3134 transitions. [2020-01-16 18:06:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:27,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:27,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:27,488 INFO L426 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -824697033, now seen corresponding path program 353 times [2020-01-16 18:06:27,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:27,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828098215] [2020-01-16 18:06:27,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:27,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828098215] [2020-01-16 18:06:27,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:27,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:27,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882688121] [2020-01-16 18:06:27,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:27,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:27,965 INFO L87 Difference]: Start difference. First operand 790 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:06:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:28,129 INFO L93 Difference]: Finished difference Result 1422 states and 4952 transitions. [2020-01-16 18:06:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:28,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:28,133 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:06:28,133 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:06:28,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:06:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 796. [2020-01-16 18:06:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:06:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-01-16 18:06:28,155 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-01-16 18:06:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:28,155 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-01-16 18:06:28,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-01-16 18:06:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:28,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:28,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] [2020-01-16 18:06:28,157 INFO L426 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash 786243925, now seen corresponding path program 354 times [2020-01-16 18:06:28,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:28,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839983425] [2020-01-16 18:06:28,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:28,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839983425] [2020-01-16 18:06:28,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:28,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:28,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002232090] [2020-01-16 18:06:28,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:28,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:28,621 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:06:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:28,742 INFO L93 Difference]: Finished difference Result 1426 states and 4954 transitions. [2020-01-16 18:06:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:28,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:28,746 INFO L225 Difference]: With dead ends: 1426 [2020-01-16 18:06:28,747 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:06:28,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:06:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 784. [2020-01-16 18:06:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:06:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:06:28,769 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:06:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:28,769 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:06:28,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:06:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:28,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:28,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:28,771 INFO L426 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1614198605, now seen corresponding path program 355 times [2020-01-16 18:06:28,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:28,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633513885] [2020-01-16 18:06:28,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:29,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633513885] [2020-01-16 18:06:29,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:29,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:29,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292369292] [2020-01-16 18:06:29,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:29,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:29,214 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:06:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:29,366 INFO L93 Difference]: Finished difference Result 1401 states and 4907 transitions. [2020-01-16 18:06:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:29,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:29,370 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:06:29,370 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:06:29,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:06:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-01-16 18:06:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:06:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-01-16 18:06:29,392 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-01-16 18:06:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:29,392 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-01-16 18:06:29,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-01-16 18:06:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:29,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:29,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] [2020-01-16 18:06:29,393 INFO L426 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1607683311, now seen corresponding path program 356 times [2020-01-16 18:06:29,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:29,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737137289] [2020-01-16 18:06:29,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:29,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737137289] [2020-01-16 18:06:29,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:29,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:29,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74502390] [2020-01-16 18:06:29,836 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:29,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:29,837 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:06:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:29,985 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-01-16 18:06:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:29,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:29,990 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:06:29,990 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:06:29,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:06:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 788. [2020-01-16 18:06:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-01-16 18:06:30,012 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-01-16 18:06:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:30,012 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-01-16 18:06:30,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-01-16 18:06:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:30,013 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:30,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] [2020-01-16 18:06:30,013 INFO L426 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1080330837, now seen corresponding path program 357 times [2020-01-16 18:06:30,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:30,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202124460] [2020-01-16 18:06:30,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202124460] [2020-01-16 18:06:30,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:30,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:30,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070403854] [2020-01-16 18:06:30,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:30,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:30,488 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:06:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:30,639 INFO L93 Difference]: Finished difference Result 1406 states and 4913 transitions. [2020-01-16 18:06:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:30,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:30,643 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:06:30,643 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:06:30,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:06:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-01-16 18:06:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:06:30,666 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:06:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:30,666 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:06:30,666 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:06:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:30,667 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:30,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:30,667 INFO L426 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1618186415, now seen corresponding path program 358 times [2020-01-16 18:06:30,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:30,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987035971] [2020-01-16 18:06:30,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:31,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-01-16 18:06:31,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987035971] [2020-01-16 18:06:31,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:31,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:31,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172856928] [2020-01-16 18:06:31,116 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:31,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:31,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:31,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:31,116 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:06:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:31,266 INFO L93 Difference]: Finished difference Result 1412 states and 4921 transitions. [2020-01-16 18:06:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:31,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:31,270 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:06:31,270 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:06:31,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:06:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 788. [2020-01-16 18:06:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:06:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3126 transitions. [2020-01-16 18:06:31,293 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3126 transitions. Word has length 25 [2020-01-16 18:06:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:31,293 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3126 transitions. [2020-01-16 18:06:31,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3126 transitions. [2020-01-16 18:06:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:31,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:31,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:31,294 INFO L426 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337045, now seen corresponding path program 359 times [2020-01-16 18:06:31,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:31,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370414893] [2020-01-16 18:06:31,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:31,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370414893] [2020-01-16 18:06:31,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:31,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:31,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59154340] [2020-01-16 18:06:31,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:31,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:31,733 INFO L87 Difference]: Start difference. First operand 788 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:06:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:31,881 INFO L93 Difference]: Finished difference Result 1412 states and 4923 transitions. [2020-01-16 18:06:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:31,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:31,885 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:06:31,885 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:06:31,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:06:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:06:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:06:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:06:31,907 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:06:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:31,907 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:06:31,907 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:06:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:31,908 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:31,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] [2020-01-16 18:06:31,909 INFO L426 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1582689293, now seen corresponding path program 360 times [2020-01-16 18:06:31,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:31,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946369450] [2020-01-16 18:06:31,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:32,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946369450] [2020-01-16 18:06:32,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:32,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:32,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426156594] [2020-01-16 18:06:32,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:32,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:32,361 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:06:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:32,487 INFO L93 Difference]: Finished difference Result 1416 states and 4925 transitions. [2020-01-16 18:06:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:32,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:32,491 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:06:32,491 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:06:32,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:06:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 776. [2020-01-16 18:06:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:06:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3101 transitions. [2020-01-16 18:06:32,516 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3101 transitions. Word has length 25 [2020-01-16 18:06:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:32,517 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3101 transitions. [2020-01-16 18:06:32,517 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3101 transitions. [2020-01-16 18:06:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:32,518 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:32,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:32,518 INFO L426 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash 519656473, now seen corresponding path program 361 times [2020-01-16 18:06:32,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:32,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310275057] [2020-01-16 18:06:32,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:32,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310275057] [2020-01-16 18:06:32,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:32,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:32,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162192035] [2020-01-16 18:06:32,969 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:32,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:32,969 INFO L87 Difference]: Start difference. First operand 776 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:06:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:33,140 INFO L93 Difference]: Finished difference Result 1450 states and 5092 transitions. [2020-01-16 18:06:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:33,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:33,144 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:06:33,144 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:06:33,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:06:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-01-16 18:06:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3180 transitions. [2020-01-16 18:06:33,167 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3180 transitions. Word has length 25 [2020-01-16 18:06:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:33,167 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3180 transitions. [2020-01-16 18:06:33,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3180 transitions. [2020-01-16 18:06:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:33,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:33,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:33,168 INFO L426 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1489908087, now seen corresponding path program 362 times [2020-01-16 18:06:33,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:33,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918644393] [2020-01-16 18:06:33,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:33,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918644393] [2020-01-16 18:06:33,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:33,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:33,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318166808] [2020-01-16 18:06:33,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:33,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:33,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:33,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:33,649 INFO L87 Difference]: Start difference. First operand 797 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:06:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:33,824 INFO L93 Difference]: Finished difference Result 1452 states and 5092 transitions. [2020-01-16 18:06:33,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:33,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:33,828 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:06:33,828 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:06:33,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:06:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 793. [2020-01-16 18:06:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-01-16 18:06:33,851 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-01-16 18:06:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:33,851 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-01-16 18:06:33,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-01-16 18:06:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:33,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:33,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:33,852 INFO L426 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 76757333, now seen corresponding path program 363 times [2020-01-16 18:06:33,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:33,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933874676] [2020-01-16 18:06:33,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:34,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933874676] [2020-01-16 18:06:34,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:34,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:34,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236303724] [2020-01-16 18:06:34,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:34,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:34,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:34,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:34,313 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:06:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:34,461 INFO L93 Difference]: Finished difference Result 1451 states and 5090 transitions. [2020-01-16 18:06:34,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:34,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:34,465 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:06:34,465 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:06:34,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:06:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 797. [2020-01-16 18:06:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-01-16 18:06:34,488 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-01-16 18:06:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:34,488 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-01-16 18:06:34,488 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-01-16 18:06:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:34,489 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:34,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:34,489 INFO L426 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1068015155, now seen corresponding path program 364 times [2020-01-16 18:06:34,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:34,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997653740] [2020-01-16 18:06:34,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:34,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997653740] [2020-01-16 18:06:34,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:34,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:34,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258855358] [2020-01-16 18:06:34,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:34,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:34,945 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:06:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:35,103 INFO L93 Difference]: Finished difference Result 1454 states and 5092 transitions. [2020-01-16 18:06:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:35,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:35,107 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:06:35,107 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:06:35,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:06:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 793. [2020-01-16 18:06:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:06:35,129 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:06:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:35,129 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:06:35,130 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:06:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:35,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:35,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:35,131 INFO L426 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2140837799, now seen corresponding path program 365 times [2020-01-16 18:06:35,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:35,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903249741] [2020-01-16 18:06:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:35,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903249741] [2020-01-16 18:06:35,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:35,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:35,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587001957] [2020-01-16 18:06:35,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:35,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:35,593 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:06:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:35,742 INFO L93 Difference]: Finished difference Result 1457 states and 5100 transitions. [2020-01-16 18:06:35,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:35,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:35,746 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:06:35,746 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:06:35,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:06:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2020-01-16 18:06:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:06:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3176 transitions. [2020-01-16 18:06:35,769 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3176 transitions. Word has length 25 [2020-01-16 18:06:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:35,769 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3176 transitions. [2020-01-16 18:06:35,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3176 transitions. [2020-01-16 18:06:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:35,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:35,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:35,771 INFO L426 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1081044117, now seen corresponding path program 366 times [2020-01-16 18:06:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141093924] [2020-01-16 18:06:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:36,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141093924] [2020-01-16 18:06:36,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:36,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:36,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186882966] [2020-01-16 18:06:36,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:36,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:36,230 INFO L87 Difference]: Start difference. First operand 799 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:06:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:36,390 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:06:36,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:36,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:36,395 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:06:36,395 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:06:36,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:06:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-01-16 18:06:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:06:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-01-16 18:06:36,418 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-01-16 18:06:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:36,418 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-01-16 18:06:36,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-01-16 18:06:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:36,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:36,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:36,419 INFO L426 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash 97170747, now seen corresponding path program 367 times [2020-01-16 18:06:36,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:36,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194717924] [2020-01-16 18:06:36,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:36,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194717924] [2020-01-16 18:06:36,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:36,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:36,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082533450] [2020-01-16 18:06:36,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:36,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:36,895 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:06:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:37,043 INFO L93 Difference]: Finished difference Result 1447 states and 5081 transitions. [2020-01-16 18:06:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:37,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:37,047 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:06:37,047 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:06:37,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:06:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:06:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-01-16 18:06:37,071 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-01-16 18:06:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:37,072 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-01-16 18:06:37,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-01-16 18:06:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:37,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:37,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:37,073 INFO L426 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1067422361, now seen corresponding path program 368 times [2020-01-16 18:06:37,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:37,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168455437] [2020-01-16 18:06:37,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:37,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-01-16 18:06:37,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168455437] [2020-01-16 18:06:37,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:37,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:37,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958652949] [2020-01-16 18:06:37,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:37,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:37,530 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:06:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:37,682 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-01-16 18:06:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:37,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:37,686 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:06:37,686 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:06:37,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:06:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:06:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-01-16 18:06:37,708 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-01-16 18:06:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:37,709 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-01-16 18:06:37,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-01-16 18:06:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:37,710 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:37,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:37,710 INFO L426 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1580305685, now seen corresponding path program 369 times [2020-01-16 18:06:37,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:37,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064061785] [2020-01-16 18:06:37,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:38,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064061785] [2020-01-16 18:06:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:38,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098296905] [2020-01-16 18:06:38,170 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:38,171 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:06:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:38,341 INFO L93 Difference]: Finished difference Result 1446 states and 5075 transitions. [2020-01-16 18:06:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:38,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:38,344 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:06:38,345 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:06:38,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:06:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 797. [2020-01-16 18:06:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-01-16 18:06:38,367 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-01-16 18:06:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:38,367 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-01-16 18:06:38,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-01-16 18:06:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:38,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:38,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:38,368 INFO L426 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1712900685, now seen corresponding path program 370 times [2020-01-16 18:06:38,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:38,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93503911] [2020-01-16 18:06:38,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:38,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-01-16 18:06:38,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93503911] [2020-01-16 18:06:38,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:38,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:38,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043850015] [2020-01-16 18:06:38,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:38,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:38,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:38,843 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:06:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:38,994 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-01-16 18:06:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:38,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:38,998 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:06:38,998 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:06:38,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:06:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-01-16 18:06:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:06:39,021 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:06:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:39,021 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:06:39,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:06:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:39,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:39,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:39,023 INFO L426 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2057239995, now seen corresponding path program 371 times [2020-01-16 18:06:39,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:39,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029993267] [2020-01-16 18:06:39,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:39,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029993267] [2020-01-16 18:06:39,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:39,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:39,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918349629] [2020-01-16 18:06:39,479 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:39,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:39,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:39,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:39,480 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:06:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:39,645 INFO L93 Difference]: Finished difference Result 1451 states and 5082 transitions. [2020-01-16 18:06:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:39,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:39,648 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:06:39,648 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:06:39,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:06:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-01-16 18:06:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:06:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-01-16 18:06:39,671 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-01-16 18:06:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:39,671 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-01-16 18:06:39,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-01-16 18:06:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:39,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:39,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:39,672 INFO L426 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1699871723, now seen corresponding path program 372 times [2020-01-16 18:06:39,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:39,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260646912] [2020-01-16 18:06:39,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:40,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-01-16 18:06:40,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260646912] [2020-01-16 18:06:40,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:40,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:40,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801660452] [2020-01-16 18:06:40,148 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:40,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:40,149 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:06:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:40,307 INFO L93 Difference]: Finished difference Result 1450 states and 5075 transitions. [2020-01-16 18:06:40,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:40,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:40,311 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:06:40,311 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:06:40,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:06:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2020-01-16 18:06:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:06:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-01-16 18:06:40,334 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-01-16 18:06:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:40,334 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-01-16 18:06:40,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-01-16 18:06:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:40,335 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:40,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:40,335 INFO L426 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699845, now seen corresponding path program 373 times [2020-01-16 18:06:40,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:40,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106686508] [2020-01-16 18:06:40,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106686508] [2020-01-16 18:06:40,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:40,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:40,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109702749] [2020-01-16 18:06:40,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:40,788 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:06:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:40,944 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-01-16 18:06:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:40,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:40,948 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:06:40,948 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:06:40,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:06:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-01-16 18:06:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-01-16 18:06:40,970 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-01-16 18:06:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:40,970 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-01-16 18:06:40,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-01-16 18:06:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:40,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:40,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:40,971 INFO L426 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash -199442023, now seen corresponding path program 374 times [2020-01-16 18:06:40,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:40,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314318098] [2020-01-16 18:06:40,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:41,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314318098] [2020-01-16 18:06:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:41,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:41,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008952160] [2020-01-16 18:06:41,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:41,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:41,427 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:06:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:41,594 INFO L93 Difference]: Finished difference Result 1452 states and 5083 transitions. [2020-01-16 18:06:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:41,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:41,598 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:06:41,598 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:06:41,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:06:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 793. [2020-01-16 18:06:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-01-16 18:06:41,620 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-01-16 18:06:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:41,620 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-01-16 18:06:41,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-01-16 18:06:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:41,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:41,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:41,622 INFO L426 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 735334233, now seen corresponding path program 375 times [2020-01-16 18:06:41,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:41,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012781786] [2020-01-16 18:06:41,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:42,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012781786] [2020-01-16 18:06:42,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:42,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:42,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921425086] [2020-01-16 18:06:42,080 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:42,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:42,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:42,080 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:06:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:42,230 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-01-16 18:06:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:42,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:42,234 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:06:42,234 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:06:42,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:06:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:06:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:06:42,257 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:06:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:42,257 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:06:42,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:06:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:42,258 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:42,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] [2020-01-16 18:06:42,259 INFO L426 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1737095159, now seen corresponding path program 376 times [2020-01-16 18:06:42,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:42,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679819084] [2020-01-16 18:06:42,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:42,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-01-16 18:06:42,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679819084] [2020-01-16 18:06:42,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:42,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:42,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064254106] [2020-01-16 18:06:42,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:42,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:42,726 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:06:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:42,893 INFO L93 Difference]: Finished difference Result 1448 states and 5071 transitions. [2020-01-16 18:06:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:42,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:42,897 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:06:42,897 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:06:42,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:06:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:06:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:06:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-01-16 18:06:42,920 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-01-16 18:06:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:42,920 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-01-16 18:06:42,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-01-16 18:06:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:42,922 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:42,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:42,922 INFO L426 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash 790375611, now seen corresponding path program 377 times [2020-01-16 18:06:42,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:42,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658382504] [2020-01-16 18:06:42,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:43,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-01-16 18:06:43,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658382504] [2020-01-16 18:06:43,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:43,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:43,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973583784] [2020-01-16 18:06:43,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:43,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:43,370 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:06:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:43,544 INFO L93 Difference]: Finished difference Result 1454 states and 5084 transitions. [2020-01-16 18:06:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:43,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:43,548 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:06:43,548 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:06:43,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:06:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 798. [2020-01-16 18:06:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:06:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-01-16 18:06:43,573 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-01-16 18:06:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:43,573 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-01-16 18:06:43,574 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-01-16 18:06:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:43,575 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:43,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:43,575 INFO L426 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1893650727, now seen corresponding path program 378 times [2020-01-16 18:06:43,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:43,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624878411] [2020-01-16 18:06:43,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:44,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624878411] [2020-01-16 18:06:44,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:44,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:44,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305160457] [2020-01-16 18:06:44,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:44,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:44,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:44,021 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-01-16 18:06:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:44,178 INFO L93 Difference]: Finished difference Result 1452 states and 5075 transitions. [2020-01-16 18:06:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:44,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:44,183 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:06:44,183 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:06:44,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:06:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 789. [2020-01-16 18:06:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:06:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-01-16 18:06:44,207 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-01-16 18:06:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:44,207 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-01-16 18:06:44,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-01-16 18:06:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:44,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:44,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] [2020-01-16 18:06:44,208 INFO L426 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1521262217, now seen corresponding path program 379 times [2020-01-16 18:06:44,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:44,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384067681] [2020-01-16 18:06:44,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:44,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384067681] [2020-01-16 18:06:44,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:44,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:44,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74313982] [2020-01-16 18:06:44,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:44,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:44,671 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:06:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:44,815 INFO L93 Difference]: Finished difference Result 1461 states and 5108 transitions. [2020-01-16 18:06:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:44,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:44,820 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:06:44,820 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:06:44,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:06:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 800. [2020-01-16 18:06:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:06:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3176 transitions. [2020-01-16 18:06:44,846 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3176 transitions. Word has length 25 [2020-01-16 18:06:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:44,846 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3176 transitions. [2020-01-16 18:06:44,846 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3176 transitions. [2020-01-16 18:06:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:44,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:44,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] [2020-01-16 18:06:44,847 INFO L426 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1700619699, now seen corresponding path program 380 times [2020-01-16 18:06:44,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:44,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143369115] [2020-01-16 18:06:44,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:45,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143369115] [2020-01-16 18:06:45,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:45,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:45,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528006738] [2020-01-16 18:06:45,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:45,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:45,312 INFO L87 Difference]: Start difference. First operand 800 states and 3176 transitions. Second operand 10 states. [2020-01-16 18:06:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:45,457 INFO L93 Difference]: Finished difference Result 1462 states and 5104 transitions. [2020-01-16 18:06:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:45,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:45,461 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:06:45,461 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:06:45,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:06:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 794. [2020-01-16 18:06:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:06:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3160 transitions. [2020-01-16 18:06:45,483 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3160 transitions. Word has length 25 [2020-01-16 18:06:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:45,483 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3160 transitions. [2020-01-16 18:06:45,483 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3160 transitions. [2020-01-16 18:06:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:45,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:45,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] [2020-01-16 18:06:45,484 INFO L426 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1173267225, now seen corresponding path program 381 times [2020-01-16 18:06:45,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:45,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885829142] [2020-01-16 18:06:45,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:45,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885829142] [2020-01-16 18:06:45,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:45,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:45,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020049618] [2020-01-16 18:06:45,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:45,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:45,960 INFO L87 Difference]: Start difference. First operand 794 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:06:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:46,105 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:06:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:46,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:46,109 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:06:46,109 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:06:46,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:06:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 799. [2020-01-16 18:06:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:06:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3169 transitions. [2020-01-16 18:06:46,131 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3169 transitions. Word has length 25 [2020-01-16 18:06:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:46,131 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3169 transitions. [2020-01-16 18:06:46,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3169 transitions. [2020-01-16 18:06:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:46,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:46,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] [2020-01-16 18:06:46,133 INFO L426 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1711122803, now seen corresponding path program 382 times [2020-01-16 18:06:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9820819] [2020-01-16 18:06:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9820819] [2020-01-16 18:06:46,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:46,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:46,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47559446] [2020-01-16 18:06:46,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:46,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:46,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:46,595 INFO L87 Difference]: Start difference. First operand 799 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:06:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:46,746 INFO L93 Difference]: Finished difference Result 1457 states and 5089 transitions. [2020-01-16 18:06:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:46,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:46,749 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:06:46,749 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:06:46,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:06:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-01-16 18:06:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:06:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-01-16 18:06:46,772 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-01-16 18:06:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:46,772 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-01-16 18:06:46,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-01-16 18:06:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:46,774 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:46,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:46,774 INFO L426 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1194273433, now seen corresponding path program 383 times [2020-01-16 18:06:46,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:46,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303747717] [2020-01-16 18:06:46,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:47,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-01-16 18:06:47,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303747717] [2020-01-16 18:06:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:47,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:47,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278451218] [2020-01-16 18:06:47,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:47,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:47,226 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:06:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:47,370 INFO L93 Difference]: Finished difference Result 1460 states and 5095 transitions. [2020-01-16 18:06:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:47,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:47,374 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:06:47,375 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:06:47,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:06:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 799. [2020-01-16 18:06:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:06:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3164 transitions. [2020-01-16 18:06:47,397 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3164 transitions. Word has length 25 [2020-01-16 18:06:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:47,397 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3164 transitions. [2020-01-16 18:06:47,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3164 transitions. [2020-01-16 18:06:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:47,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:47,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:47,398 INFO L426 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1489752905, now seen corresponding path program 384 times [2020-01-16 18:06:47,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:47,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200683035] [2020-01-16 18:06:47,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:47,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-01-16 18:06:47,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200683035] [2020-01-16 18:06:47,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:47,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:47,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461192021] [2020-01-16 18:06:47,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:47,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:47,855 INFO L87 Difference]: Start difference. First operand 799 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:06:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:48,010 INFO L93 Difference]: Finished difference Result 1458 states and 5086 transitions. [2020-01-16 18:06:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:48,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:48,014 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:06:48,015 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:06:48,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:06:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 785. [2020-01-16 18:06:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:06:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-01-16 18:06:48,036 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-01-16 18:06:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:48,036 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-01-16 18:06:48,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-01-16 18:06:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:48,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:48,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:48,038 INFO L426 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash 307500855, now seen corresponding path program 385 times [2020-01-16 18:06:48,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:48,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168300505] [2020-01-16 18:06:48,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:48,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168300505] [2020-01-16 18:06:48,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:48,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:48,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108646351] [2020-01-16 18:06:48,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:48,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:48,494 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:06:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:48,650 INFO L93 Difference]: Finished difference Result 1471 states and 5138 transitions. [2020-01-16 18:06:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:48,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:48,654 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:06:48,655 INFO L226 Difference]: Without dead ends: 1458 [2020-01-16 18:06:48,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-01-16 18:06:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 800. [2020-01-16 18:06:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:06:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3185 transitions. [2020-01-16 18:06:48,693 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3185 transitions. Word has length 25 [2020-01-16 18:06:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:48,693 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3185 transitions. [2020-01-16 18:06:48,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3185 transitions. [2020-01-16 18:06:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:48,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:48,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:48,695 INFO L426 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1277752469, now seen corresponding path program 386 times [2020-01-16 18:06:48,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:48,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797409105] [2020-01-16 18:06:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:49,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-01-16 18:06:49,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797409105] [2020-01-16 18:06:49,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:49,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:49,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231399443] [2020-01-16 18:06:49,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:49,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:49,143 INFO L87 Difference]: Start difference. First operand 800 states and 3185 transitions. Second operand 10 states. [2020-01-16 18:06:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:49,300 INFO L93 Difference]: Finished difference Result 1473 states and 5138 transitions. [2020-01-16 18:06:49,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:49,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:49,304 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:06:49,304 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:06:49,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:06:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-01-16 18:06:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:06:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3174 transitions. [2020-01-16 18:06:49,327 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3174 transitions. Word has length 25 [2020-01-16 18:06:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:49,327 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3174 transitions. [2020-01-16 18:06:49,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3174 transitions. [2020-01-16 18:06:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:49,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:49,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:49,329 INFO L426 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash -135398285, now seen corresponding path program 387 times [2020-01-16 18:06:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:49,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838003246] [2020-01-16 18:06:49,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:49,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838003246] [2020-01-16 18:06:49,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:49,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:49,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013775324] [2020-01-16 18:06:49,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:49,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:49,784 INFO L87 Difference]: Start difference. First operand 796 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:06:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:49,937 INFO L93 Difference]: Finished difference Result 1472 states and 5136 transitions. [2020-01-16 18:06:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:49,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:49,941 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:06:49,941 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:06:49,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:06:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 800. [2020-01-16 18:06:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:06:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3181 transitions. [2020-01-16 18:06:49,963 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3181 transitions. Word has length 25 [2020-01-16 18:06:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:49,963 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3181 transitions. [2020-01-16 18:06:49,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3181 transitions. [2020-01-16 18:06:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:49,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:49,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:49,965 INFO L426 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 855859537, now seen corresponding path program 388 times [2020-01-16 18:06:49,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:49,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273235389] [2020-01-16 18:06:49,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:50,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273235389] [2020-01-16 18:06:50,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:50,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:50,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782520646] [2020-01-16 18:06:50,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:50,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:50,427 INFO L87 Difference]: Start difference. First operand 800 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:06:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:50,585 INFO L93 Difference]: Finished difference Result 1475 states and 5138 transitions. [2020-01-16 18:06:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:50,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:50,589 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:06:50,589 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:06:50,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:06:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2020-01-16 18:06:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:06:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3170 transitions. [2020-01-16 18:06:50,612 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3170 transitions. Word has length 25 [2020-01-16 18:06:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:50,612 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3170 transitions. [2020-01-16 18:06:50,612 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3170 transitions. [2020-01-16 18:06:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:50,613 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:50,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] [2020-01-16 18:06:50,613 INFO L426 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1941973879, now seen corresponding path program 389 times [2020-01-16 18:06:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805010151] [2020-01-16 18:06:50,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:51,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805010151] [2020-01-16 18:06:51,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:51,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:51,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118588655] [2020-01-16 18:06:51,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:51,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:51,075 INFO L87 Difference]: Start difference. First operand 796 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:06:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:51,224 INFO L93 Difference]: Finished difference Result 1478 states and 5146 transitions. [2020-01-16 18:06:51,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:51,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:51,228 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:06:51,228 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:06:51,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:06:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 802. [2020-01-16 18:06:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:06:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-01-16 18:06:51,251 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-01-16 18:06:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:51,251 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-01-16 18:06:51,251 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-01-16 18:06:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:51,252 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:51,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:51,253 INFO L426 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash 868888499, now seen corresponding path program 390 times [2020-01-16 18:06:51,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:51,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565028298] [2020-01-16 18:06:51,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:51,734 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:06:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:51,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565028298] [2020-01-16 18:06:51,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:51,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:51,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099250995] [2020-01-16 18:06:51,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:51,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:51,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:51,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:51,742 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:06:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:51,914 INFO L93 Difference]: Finished difference Result 1479 states and 5142 transitions. [2020-01-16 18:06:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:51,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:51,918 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:06:51,918 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:06:51,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:06:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-01-16 18:06:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3159 transitions. [2020-01-16 18:06:51,941 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3159 transitions. Word has length 25 [2020-01-16 18:06:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:51,941 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3159 transitions. [2020-01-16 18:06:51,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3159 transitions. [2020-01-16 18:06:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:51,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:51,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:51,943 INFO L426 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -537470597, now seen corresponding path program 391 times [2020-01-16 18:06:51,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:51,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644008681] [2020-01-16 18:06:51,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:52,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-01-16 18:06:52,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644008681] [2020-01-16 18:06:52,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:52,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:52,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086677530] [2020-01-16 18:06:52,402 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:52,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:52,402 INFO L87 Difference]: Start difference. First operand 792 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:06:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:52,567 INFO L93 Difference]: Finished difference Result 1476 states and 5144 transitions. [2020-01-16 18:06:52,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:52,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:52,571 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:06:52,572 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:06:52,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:06:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 801. [2020-01-16 18:06:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:06:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3184 transitions. [2020-01-16 18:06:52,595 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3184 transitions. Word has length 25 [2020-01-16 18:06:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:52,595 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3184 transitions. [2020-01-16 18:06:52,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3184 transitions. [2020-01-16 18:06:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:52,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:52,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] [2020-01-16 18:06:52,596 INFO L426 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 432781017, now seen corresponding path program 392 times [2020-01-16 18:06:52,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:52,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366307825] [2020-01-16 18:06:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:53,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-01-16 18:06:53,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366307825] [2020-01-16 18:06:53,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:53,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:53,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506665634] [2020-01-16 18:06:53,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:53,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:53,058 INFO L87 Difference]: Start difference. First operand 801 states and 3184 transitions. Second operand 10 states. [2020-01-16 18:06:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:53,220 INFO L93 Difference]: Finished difference Result 1478 states and 5144 transitions. [2020-01-16 18:06:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:53,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:53,225 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:06:53,225 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:06:53,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:06:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 797. [2020-01-16 18:06:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3173 transitions. [2020-01-16 18:06:53,248 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3173 transitions. Word has length 25 [2020-01-16 18:06:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:53,248 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3173 transitions. [2020-01-16 18:06:53,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3173 transitions. [2020-01-16 18:06:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:53,249 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:53,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:53,249 INFO L426 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1423268877, now seen corresponding path program 393 times [2020-01-16 18:06:53,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:53,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117851339] [2020-01-16 18:06:53,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:53,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117851339] [2020-01-16 18:06:53,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:53,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:53,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628745591] [2020-01-16 18:06:53,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:53,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:53,718 INFO L87 Difference]: Start difference. First operand 797 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:06:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:53,903 INFO L93 Difference]: Finished difference Result 1480 states and 5147 transitions. [2020-01-16 18:06:53,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:53,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:53,907 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:06:53,907 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:06:53,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:06:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 802. [2020-01-16 18:06:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:06:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3182 transitions. [2020-01-16 18:06:53,929 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3182 transitions. Word has length 25 [2020-01-16 18:06:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:53,930 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3182 transitions. [2020-01-16 18:06:53,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3182 transitions. [2020-01-16 18:06:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:53,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:53,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:53,931 INFO L426 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -411004847, now seen corresponding path program 394 times [2020-01-16 18:06:53,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:53,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302330022] [2020-01-16 18:06:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:54,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302330022] [2020-01-16 18:06:54,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:54,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:54,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216351589] [2020-01-16 18:06:54,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:54,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:54,406 INFO L87 Difference]: Start difference. First operand 802 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:06:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:54,532 INFO L93 Difference]: Finished difference Result 1485 states and 5152 transitions. [2020-01-16 18:06:54,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:54,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:54,536 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:06:54,536 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:06:54,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:06:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 797. [2020-01-16 18:06:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:06:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-01-16 18:06:54,559 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-01-16 18:06:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:54,559 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-01-16 18:06:54,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-01-16 18:06:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:54,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:54,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:54,560 INFO L426 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1748194875, now seen corresponding path program 395 times [2020-01-16 18:06:54,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:54,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858130418] [2020-01-16 18:06:54,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:55,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858130418] [2020-01-16 18:06:55,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:55,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:55,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386129275] [2020-01-16 18:06:55,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:55,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:55,033 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:06:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:55,200 INFO L93 Difference]: Finished difference Result 1486 states and 5156 transitions. [2020-01-16 18:06:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:55,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:55,204 INFO L225 Difference]: With dead ends: 1486 [2020-01-16 18:06:55,204 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:06:55,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:06:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-01-16 18:06:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:06:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3181 transitions. [2020-01-16 18:06:55,227 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3181 transitions. Word has length 25 [2020-01-16 18:06:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:55,227 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3181 transitions. [2020-01-16 18:06:55,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3181 transitions. [2020-01-16 18:06:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:55,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:55,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:55,229 INFO L426 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash -397975885, now seen corresponding path program 396 times [2020-01-16 18:06:55,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:55,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837064901] [2020-01-16 18:06:55,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:55,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837064901] [2020-01-16 18:06:55,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:55,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555274903] [2020-01-16 18:06:55,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:55,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:55,707 INFO L87 Difference]: Start difference. First operand 804 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:06:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:55,880 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-01-16 18:06:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:55,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:55,884 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:06:55,885 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:06:55,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:06:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 792. [2020-01-16 18:06:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-01-16 18:06:55,907 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-01-16 18:06:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:55,907 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-01-16 18:06:55,907 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-01-16 18:06:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:55,908 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:55,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:55,908 INFO L426 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1825341189, now seen corresponding path program 397 times [2020-01-16 18:06:55,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:55,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600726723] [2020-01-16 18:06:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:56,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600726723] [2020-01-16 18:06:56,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:56,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:56,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086823050] [2020-01-16 18:06:56,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:56,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:56,372 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:06:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:56,532 INFO L93 Difference]: Finished difference Result 1481 states and 5149 transitions. [2020-01-16 18:06:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:56,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:56,536 INFO L225 Difference]: With dead ends: 1481 [2020-01-16 18:06:56,537 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:06:56,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:06:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 802. [2020-01-16 18:06:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:06:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-01-16 18:06:56,559 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-01-16 18:06:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:56,559 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-01-16 18:06:56,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-01-16 18:06:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:56,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:56,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:56,561 INFO L426 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -834083367, now seen corresponding path program 398 times [2020-01-16 18:06:56,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:56,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777654448] [2020-01-16 18:06:56,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:57,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777654448] [2020-01-16 18:06:57,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:57,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:57,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142183605] [2020-01-16 18:06:57,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:57,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:57,039 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:06:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:57,206 INFO L93 Difference]: Finished difference Result 1484 states and 5151 transitions. [2020-01-16 18:06:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:57,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:57,210 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:06:57,210 INFO L226 Difference]: Without dead ends: 1464 [2020-01-16 18:06:57,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-01-16 18:06:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 798. [2020-01-16 18:06:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:06:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-01-16 18:06:57,233 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-01-16 18:06:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:57,233 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-01-16 18:06:57,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-01-16 18:06:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:57,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:57,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:57,234 INFO L426 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2026726967, now seen corresponding path program 399 times [2020-01-16 18:06:57,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:57,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143271005] [2020-01-16 18:06:57,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:57,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143271005] [2020-01-16 18:06:57,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:57,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:57,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931187935] [2020-01-16 18:06:57,696 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:57,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:57,697 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:06:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:57,866 INFO L93 Difference]: Finished difference Result 1484 states and 5150 transitions. [2020-01-16 18:06:57,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:57,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:57,870 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:06:57,870 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:06:57,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:06:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 803. [2020-01-16 18:06:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:06:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3179 transitions. [2020-01-16 18:06:57,892 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3179 transitions. Word has length 25 [2020-01-16 18:06:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:57,892 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3179 transitions. [2020-01-16 18:06:57,892 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3179 transitions. [2020-01-16 18:06:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:57,893 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:57,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:57,894 INFO L426 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1255976299, now seen corresponding path program 400 times [2020-01-16 18:06:57,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:57,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680919470] [2020-01-16 18:06:57,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:06:58,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680919470] [2020-01-16 18:06:58,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:58,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:58,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231049406] [2020-01-16 18:06:58,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:58,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:58,384 INFO L87 Difference]: Start difference. First operand 803 states and 3179 transitions. Second operand 10 states. [2020-01-16 18:06:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:58,520 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-01-16 18:06:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:58,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:58,524 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:06:58,524 INFO L226 Difference]: Without dead ends: 1466 [2020-01-16 18:06:58,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-01-16 18:06:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 798. [2020-01-16 18:06:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:06:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3165 transitions. [2020-01-16 18:06:58,548 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3165 transitions. Word has length 25 [2020-01-16 18:06:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:58,548 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3165 transitions. [2020-01-16 18:06:58,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3165 transitions. [2020-01-16 18:06:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:58,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:58,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:58,550 INFO L426 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash 481330491, now seen corresponding path program 401 times [2020-01-16 18:06:58,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:58,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815287099] [2020-01-16 18:06:58,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:59,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-01-16 18:06:59,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815287099] [2020-01-16 18:06:59,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:59,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:59,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627671352] [2020-01-16 18:06:59,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:59,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:59,014 INFO L87 Difference]: Start difference. First operand 798 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:06:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:59,222 INFO L93 Difference]: Finished difference Result 1494 states and 5167 transitions. [2020-01-16 18:06:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:59,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:59,226 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:06:59,227 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:06:59,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:06:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 807. [2020-01-16 18:06:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:06:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3181 transitions. [2020-01-16 18:06:59,249 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3181 transitions. Word has length 25 [2020-01-16 18:06:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:59,250 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3181 transitions. [2020-01-16 18:06:59,250 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3181 transitions. [2020-01-16 18:06:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:59,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:59,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:59,251 INFO L426 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash -591754889, now seen corresponding path program 402 times [2020-01-16 18:06:59,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:59,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381438888] [2020-01-16 18:06:59,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:06:59,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-01-16 18:06:59,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381438888] [2020-01-16 18:06:59,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:06:59,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:06:59,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666546971] [2020-01-16 18:06:59,725 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:06:59,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:06:59,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:06:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:06:59,726 INFO L87 Difference]: Start difference. First operand 807 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:06:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:06:59,914 INFO L93 Difference]: Finished difference Result 1496 states and 5163 transitions. [2020-01-16 18:06:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:06:59,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:06:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:06:59,918 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:06:59,919 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:06:59,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:06:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:06:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 792. [2020-01-16 18:06:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:06:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3148 transitions. [2020-01-16 18:06:59,941 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3148 transitions. Word has length 25 [2020-01-16 18:06:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:06:59,941 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3148 transitions. [2020-01-16 18:06:59,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:06:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3148 transitions. [2020-01-16 18:06:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:06:59,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:06:59,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:06:59,942 INFO L426 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:06:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:06:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash -229869483, now seen corresponding path program 403 times [2020-01-16 18:06:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:06:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056473598] [2020-01-16 18:06:59,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:06:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:00,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056473598] [2020-01-16 18:07:00,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:00,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:00,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037798024] [2020-01-16 18:07:00,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:00,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:00,412 INFO L87 Difference]: Start difference. First operand 792 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:07:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:00,580 INFO L93 Difference]: Finished difference Result 1496 states and 5182 transitions. [2020-01-16 18:07:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:00,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:00,584 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:07:00,585 INFO L226 Difference]: Without dead ends: 1481 [2020-01-16 18:07:00,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-01-16 18:07:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 807. [2020-01-16 18:07:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:07:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3188 transitions. [2020-01-16 18:07:00,609 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3188 transitions. Word has length 25 [2020-01-16 18:07:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:00,609 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3188 transitions. [2020-01-16 18:07:00,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3188 transitions. [2020-01-16 18:07:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:00,610 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:00,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:00,611 INFO L426 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954863, now seen corresponding path program 404 times [2020-01-16 18:07:00,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:00,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459159106] [2020-01-16 18:07:00,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:01,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459159106] [2020-01-16 18:07:01,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:01,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:01,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493051652] [2020-01-16 18:07:01,086 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:01,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:01,087 INFO L87 Difference]: Start difference. First operand 807 states and 3188 transitions. Second operand 10 states. [2020-01-16 18:07:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:01,246 INFO L93 Difference]: Finished difference Result 1497 states and 5178 transitions. [2020-01-16 18:07:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:01,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:01,250 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:07:01,250 INFO L226 Difference]: Without dead ends: 1475 [2020-01-16 18:07:01,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-01-16 18:07:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 801. [2020-01-16 18:07:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3171 transitions. [2020-01-16 18:07:01,288 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3171 transitions. Word has length 25 [2020-01-16 18:07:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:01,288 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3171 transitions. [2020-01-16 18:07:01,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3171 transitions. [2020-01-16 18:07:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:01,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:01,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:01,290 INFO L426 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 864222105, now seen corresponding path program 405 times [2020-01-16 18:07:01,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:01,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101524862] [2020-01-16 18:07:01,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:01,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101524862] [2020-01-16 18:07:01,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:01,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:01,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038437869] [2020-01-16 18:07:01,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:01,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:01,758 INFO L87 Difference]: Start difference. First operand 801 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:07:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:01,920 INFO L93 Difference]: Finished difference Result 1499 states and 5181 transitions. [2020-01-16 18:07:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:01,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:01,923 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:07:01,923 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:07:01,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:07:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 808. [2020-01-16 18:07:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:07:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3184 transitions. [2020-01-16 18:07:01,946 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3184 transitions. Word has length 25 [2020-01-16 18:07:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:01,946 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3184 transitions. [2020-01-16 18:07:01,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3184 transitions. [2020-01-16 18:07:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:01,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:01,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:01,948 INFO L426 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1281948655, now seen corresponding path program 406 times [2020-01-16 18:07:01,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:01,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891103968] [2020-01-16 18:07:01,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:02,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891103968] [2020-01-16 18:07:02,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:02,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:02,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094448712] [2020-01-16 18:07:02,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:02,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:02,427 INFO L87 Difference]: Start difference. First operand 808 states and 3184 transitions. Second operand 10 states. [2020-01-16 18:07:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:02,557 INFO L93 Difference]: Finished difference Result 1502 states and 5180 transitions. [2020-01-16 18:07:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:02,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:02,561 INFO L225 Difference]: With dead ends: 1502 [2020-01-16 18:07:02,561 INFO L226 Difference]: Without dead ends: 1477 [2020-01-16 18:07:02,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-01-16 18:07:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 801. [2020-01-16 18:07:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3164 transitions. [2020-01-16 18:07:02,585 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3164 transitions. Word has length 25 [2020-01-16 18:07:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:02,585 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3164 transitions. [2020-01-16 18:07:02,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3164 transitions. [2020-01-16 18:07:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:02,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:02,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:02,586 INFO L426 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 885228313, now seen corresponding path program 407 times [2020-01-16 18:07:02,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:02,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735916623] [2020-01-16 18:07:02,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:03,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735916623] [2020-01-16 18:07:03,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:03,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:03,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128319217] [2020-01-16 18:07:03,060 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:03,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:03,060 INFO L87 Difference]: Start difference. First operand 801 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:07:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:03,269 INFO L93 Difference]: Finished difference Result 1503 states and 5182 transitions. [2020-01-16 18:07:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:03,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:03,273 INFO L225 Difference]: With dead ends: 1503 [2020-01-16 18:07:03,273 INFO L226 Difference]: Without dead ends: 1487 [2020-01-16 18:07:03,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-01-16 18:07:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 810. [2020-01-16 18:07:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:07:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3180 transitions. [2020-01-16 18:07:03,296 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3180 transitions. Word has length 25 [2020-01-16 18:07:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:03,296 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3180 transitions. [2020-01-16 18:07:03,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3180 transitions. [2020-01-16 18:07:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:03,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:03,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:03,297 INFO L426 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash -187857067, now seen corresponding path program 408 times [2020-01-16 18:07:03,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:03,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437234887] [2020-01-16 18:07:03,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:03,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437234887] [2020-01-16 18:07:03,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:03,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:03,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399986337] [2020-01-16 18:07:03,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:03,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:03,785 INFO L87 Difference]: Start difference. First operand 810 states and 3180 transitions. Second operand 10 states. [2020-01-16 18:07:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:03,959 INFO L93 Difference]: Finished difference Result 1505 states and 5178 transitions. [2020-01-16 18:07:03,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:03,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:03,963 INFO L225 Difference]: With dead ends: 1505 [2020-01-16 18:07:03,963 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:07:03,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:07:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 785. [2020-01-16 18:07:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:07:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3128 transitions. [2020-01-16 18:07:03,985 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3128 transitions. Word has length 25 [2020-01-16 18:07:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:03,985 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3128 transitions. [2020-01-16 18:07:03,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3128 transitions. [2020-01-16 18:07:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:03,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:03,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:03,987 INFO L426 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash -327140489, now seen corresponding path program 409 times [2020-01-16 18:07:03,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:03,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370449805] [2020-01-16 18:07:03,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:04,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370449805] [2020-01-16 18:07:04,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:04,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:04,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478393685] [2020-01-16 18:07:04,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:04,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:04,441 INFO L87 Difference]: Start difference. First operand 785 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:07:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:04,649 INFO L93 Difference]: Finished difference Result 1456 states and 5096 transitions. [2020-01-16 18:07:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:04,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:04,651 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:07:04,652 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:07:04,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:07:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 798. [2020-01-16 18:07:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:07:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3173 transitions. [2020-01-16 18:07:04,673 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3173 transitions. Word has length 25 [2020-01-16 18:07:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:04,673 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3173 transitions. [2020-01-16 18:07:04,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3173 transitions. [2020-01-16 18:07:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:04,674 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:04,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:04,674 INFO L426 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 643111125, now seen corresponding path program 410 times [2020-01-16 18:07:04,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:04,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902998796] [2020-01-16 18:07:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:05,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902998796] [2020-01-16 18:07:05,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:05,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:05,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834740508] [2020-01-16 18:07:05,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:05,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:05,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:05,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:05,136 INFO L87 Difference]: Start difference. First operand 798 states and 3173 transitions. Second operand 10 states. [2020-01-16 18:07:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:05,301 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-01-16 18:07:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:05,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:05,305 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:07:05,305 INFO L226 Difference]: Without dead ends: 1439 [2020-01-16 18:07:05,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-01-16 18:07:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 794. [2020-01-16 18:07:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:07:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-01-16 18:07:05,327 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-01-16 18:07:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:05,328 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-01-16 18:07:05,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-01-16 18:07:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:05,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:05,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:05,329 INFO L426 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1155994449, now seen corresponding path program 411 times [2020-01-16 18:07:05,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:05,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587989110] [2020-01-16 18:07:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:05,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587989110] [2020-01-16 18:07:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:05,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877456135] [2020-01-16 18:07:05,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:05,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:05,803 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:07:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:05,972 INFO L93 Difference]: Finished difference Result 1455 states and 5090 transitions. [2020-01-16 18:07:05,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:05,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:05,976 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:07:05,976 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:07:05,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:07:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 798. [2020-01-16 18:07:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:07:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-01-16 18:07:05,999 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:06,000 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-01-16 18:07:06,000 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-01-16 18:07:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:06,001 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:06,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:06,001 INFO L426 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2137211921, now seen corresponding path program 412 times [2020-01-16 18:07:06,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:06,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218722779] [2020-01-16 18:07:06,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:06,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218722779] [2020-01-16 18:07:06,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54713394] [2020-01-16 18:07:06,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:06,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:06,475 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:06,639 INFO L93 Difference]: Finished difference Result 1456 states and 5088 transitions. [2020-01-16 18:07:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:06,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:06,644 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:07:06,644 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:07:06,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:07:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-01-16 18:07:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:07:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-01-16 18:07:06,667 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-01-16 18:07:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:06,667 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-01-16 18:07:06,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-01-16 18:07:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:06,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:06,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:06,668 INFO L426 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1632928759, now seen corresponding path program 413 times [2020-01-16 18:07:06,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:06,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775986063] [2020-01-16 18:07:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:07,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-01-16 18:07:07,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775986063] [2020-01-16 18:07:07,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:07,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:07,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012843491] [2020-01-16 18:07:07,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:07,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:07,139 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:07:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:07,303 INFO L93 Difference]: Finished difference Result 1460 states and 5097 transitions. [2020-01-16 18:07:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:07,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:07,307 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:07:07,307 INFO L226 Difference]: Without dead ends: 1445 [2020-01-16 18:07:07,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-01-16 18:07:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 799. [2020-01-16 18:07:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:07:07,329 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:07,329 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:07:07,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:07:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:07,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:07,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:07,330 INFO L426 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2124182959, now seen corresponding path program 414 times [2020-01-16 18:07:07,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:07,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425618781] [2020-01-16 18:07:07,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:07,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-01-16 18:07:07,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425618781] [2020-01-16 18:07:07,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:07,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:07,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580754236] [2020-01-16 18:07:07,797 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:07,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:07,797 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:07,957 INFO L93 Difference]: Finished difference Result 1459 states and 5090 transitions. [2020-01-16 18:07:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:07,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:07,960 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:07:07,961 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:07:07,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:07:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 790. [2020-01-16 18:07:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-01-16 18:07:08,002 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-01-16 18:07:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:08,002 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-01-16 18:07:08,002 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-01-16 18:07:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:08,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:08,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:08,003 INFO L426 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -749626215, now seen corresponding path program 415 times [2020-01-16 18:07:08,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:08,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049717356] [2020-01-16 18:07:08,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:08,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049717356] [2020-01-16 18:07:08,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:08,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:08,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334640837] [2020-01-16 18:07:08,458 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:08,458 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:07:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:08,611 INFO L93 Difference]: Finished difference Result 1464 states and 5109 transitions. [2020-01-16 18:07:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:08,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:08,616 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:07:08,616 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:07:08,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:07:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-01-16 18:07:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3172 transitions. [2020-01-16 18:07:08,638 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3172 transitions. Word has length 25 [2020-01-16 18:07:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:08,638 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3172 transitions. [2020-01-16 18:07:08,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3172 transitions. [2020-01-16 18:07:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:08,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:08,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:08,640 INFO L426 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:08,640 INFO L82 PathProgramCache]: Analyzing trace with hash 220625399, now seen corresponding path program 416 times [2020-01-16 18:07:08,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:08,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365008887] [2020-01-16 18:07:08,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:09,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365008887] [2020-01-16 18:07:09,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:09,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:09,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264896829] [2020-01-16 18:07:09,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:09,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:09,100 INFO L87 Difference]: Start difference. First operand 799 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:07:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:09,260 INFO L93 Difference]: Finished difference Result 1466 states and 5109 transitions. [2020-01-16 18:07:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:09,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:09,264 INFO L225 Difference]: With dead ends: 1466 [2020-01-16 18:07:09,264 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:07:09,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:07:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-01-16 18:07:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-01-16 18:07:09,287 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-01-16 18:07:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:09,287 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-01-16 18:07:09,287 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-01-16 18:07:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:09,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:09,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:09,288 INFO L426 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1635424495, now seen corresponding path program 417 times [2020-01-16 18:07:09,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:09,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908761580] [2020-01-16 18:07:09,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:09,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908761580] [2020-01-16 18:07:09,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:09,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:09,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486371296] [2020-01-16 18:07:09,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:09,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:09,724 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:07:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:09,867 INFO L93 Difference]: Finished difference Result 1468 states and 5112 transitions. [2020-01-16 18:07:09,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:09,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:09,871 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:07:09,871 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:07:09,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:07:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 800. [2020-01-16 18:07:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3170 transitions. [2020-01-16 18:07:09,893 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3170 transitions. Word has length 25 [2020-01-16 18:07:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:09,894 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3170 transitions. [2020-01-16 18:07:09,894 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3170 transitions. [2020-01-16 18:07:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:09,895 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:09,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:09,895 INFO L426 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash -623160465, now seen corresponding path program 418 times [2020-01-16 18:07:09,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:09,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212820928] [2020-01-16 18:07:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:10,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212820928] [2020-01-16 18:07:10,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:10,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:10,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714542124] [2020-01-16 18:07:10,369 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:10,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:10,369 INFO L87 Difference]: Start difference. First operand 800 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:07:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:10,520 INFO L93 Difference]: Finished difference Result 1473 states and 5117 transitions. [2020-01-16 18:07:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:10,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:10,524 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:07:10,524 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:07:10,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:07:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2020-01-16 18:07:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:07:10,546 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:07:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:10,546 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:07:10,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:07:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:10,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:10,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:10,548 INFO L426 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1536039257, now seen corresponding path program 419 times [2020-01-16 18:07:10,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:10,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072538576] [2020-01-16 18:07:10,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:11,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-01-16 18:07:11,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072538576] [2020-01-16 18:07:11,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:11,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:11,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961450111] [2020-01-16 18:07:11,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:11,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:11,010 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:07:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:11,170 INFO L93 Difference]: Finished difference Result 1474 states and 5121 transitions. [2020-01-16 18:07:11,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:11,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:11,174 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:07:11,174 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:07:11,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:07:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 802. [2020-01-16 18:07:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:07:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3169 transitions. [2020-01-16 18:07:11,197 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:11,197 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3169 transitions. [2020-01-16 18:07:11,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3169 transitions. [2020-01-16 18:07:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:11,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:11,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] [2020-01-16 18:07:11,198 INFO L426 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -610131503, now seen corresponding path program 420 times [2020-01-16 18:07:11,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:11,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616784686] [2020-01-16 18:07:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:11,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616784686] [2020-01-16 18:07:11,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:11,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:11,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794587198] [2020-01-16 18:07:11,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:11,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:11,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:11,683 INFO L87 Difference]: Start difference. First operand 802 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:11,818 INFO L93 Difference]: Finished difference Result 1477 states and 5120 transitions. [2020-01-16 18:07:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:11,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:11,822 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:07:11,823 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:07:11,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:07:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 790. [2020-01-16 18:07:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3142 transitions. [2020-01-16 18:07:11,845 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3142 transitions. Word has length 25 [2020-01-16 18:07:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:11,845 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3142 transitions. [2020-01-16 18:07:11,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3142 transitions. [2020-01-16 18:07:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:11,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:11,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:11,846 INFO L426 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash -533948455, now seen corresponding path program 421 times [2020-01-16 18:07:11,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:11,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608196050] [2020-01-16 18:07:11,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:12,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-01-16 18:07:12,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608196050] [2020-01-16 18:07:12,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:12,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:12,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126417177] [2020-01-16 18:07:12,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:12,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:12,310 INFO L87 Difference]: Start difference. First operand 790 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:07:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:12,472 INFO L93 Difference]: Finished difference Result 1461 states and 5097 transitions. [2020-01-16 18:07:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:12,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:12,476 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:07:12,476 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:07:12,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:07:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 799. [2020-01-16 18:07:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:07:12,499 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:12,499 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:07:12,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:07:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:12,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:12,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:12,500 INFO L426 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 467812471, now seen corresponding path program 422 times [2020-01-16 18:07:12,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:12,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710295164] [2020-01-16 18:07:12,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:12,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710295164] [2020-01-16 18:07:12,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:12,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:12,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968427282] [2020-01-16 18:07:12,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:12,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:12,965 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:13,131 INFO L93 Difference]: Finished difference Result 1462 states and 5095 transitions. [2020-01-16 18:07:13,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:13,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:13,135 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:07:13,135 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:07:13,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:07:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 795. [2020-01-16 18:07:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:07:13,158 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:07:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:13,158 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:07:13,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:07:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:13,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:13,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:13,160 INFO L426 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1392085623, now seen corresponding path program 423 times [2020-01-16 18:07:13,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:13,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693913280] [2020-01-16 18:07:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:13,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693913280] [2020-01-16 18:07:13,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:13,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:13,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593374783] [2020-01-16 18:07:13,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:13,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:13,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:13,620 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:07:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:13,769 INFO L93 Difference]: Finished difference Result 1466 states and 5102 transitions. [2020-01-16 18:07:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:13,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:13,774 INFO L225 Difference]: With dead ends: 1466 [2020-01-16 18:07:13,774 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:07:13,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:07:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-01-16 18:07:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-01-16 18:07:13,797 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-01-16 18:07:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:13,797 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-01-16 18:07:13,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-01-16 18:07:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:13,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:13,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:13,798 INFO L426 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1890617643, now seen corresponding path program 424 times [2020-01-16 18:07:13,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:13,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426318123] [2020-01-16 18:07:13,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:14,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426318123] [2020-01-16 18:07:14,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:14,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:14,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420604962] [2020-01-16 18:07:14,260 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:14,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:14,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:14,260 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:07:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:14,384 INFO L93 Difference]: Finished difference Result 1471 states and 5107 transitions. [2020-01-16 18:07:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:14,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:14,388 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:07:14,388 INFO L226 Difference]: Without dead ends: 1448 [2020-01-16 18:07:14,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-01-16 18:07:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 795. [2020-01-16 18:07:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:07:14,411 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:07:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:14,411 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:07:14,411 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:07:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:14,412 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:14,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:14,412 INFO L426 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1783226329, now seen corresponding path program 425 times [2020-01-16 18:07:14,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:14,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018290375] [2020-01-16 18:07:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:14,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-01-16 18:07:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018290375] [2020-01-16 18:07:14,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:14,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937301638] [2020-01-16 18:07:14,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:14,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:14,874 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:07:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:15,069 INFO L93 Difference]: Finished difference Result 1469 states and 5104 transitions. [2020-01-16 18:07:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:15,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:15,073 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:07:15,073 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:07:15,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:07:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 801. [2020-01-16 18:07:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-01-16 18:07:15,095 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-01-16 18:07:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:15,095 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-01-16 18:07:15,096 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-01-16 18:07:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:15,097 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:15,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:15,097 INFO L426 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -900800009, now seen corresponding path program 426 times [2020-01-16 18:07:15,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:15,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646770503] [2020-01-16 18:07:15,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:15,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646770503] [2020-01-16 18:07:15,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:15,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:15,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953922040] [2020-01-16 18:07:15,556 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:15,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:15,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:15,556 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:07:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:15,677 INFO L93 Difference]: Finished difference Result 1473 states and 5106 transitions. [2020-01-16 18:07:15,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:15,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:15,680 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:07:15,681 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:07:15,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:07:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 790. [2020-01-16 18:07:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-01-16 18:07:15,703 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-01-16 18:07:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:15,703 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-01-16 18:07:15,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-01-16 18:07:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:15,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:15,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:15,704 INFO L426 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash -538914603, now seen corresponding path program 427 times [2020-01-16 18:07:15,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:15,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775890966] [2020-01-16 18:07:15,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:16,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-01-16 18:07:16,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775890966] [2020-01-16 18:07:16,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:16,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:16,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521629685] [2020-01-16 18:07:16,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:16,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:16,167 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:07:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:16,341 INFO L93 Difference]: Finished difference Result 1472 states and 5120 transitions. [2020-01-16 18:07:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:16,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:16,345 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:07:16,345 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:07:16,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:07:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 801. [2020-01-16 18:07:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3168 transitions. [2020-01-16 18:07:16,368 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3168 transitions. Word has length 25 [2020-01-16 18:07:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:16,368 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3168 transitions. [2020-01-16 18:07:16,368 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3168 transitions. [2020-01-16 18:07:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:16,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:16,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:16,369 INFO L426 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1059025, now seen corresponding path program 428 times [2020-01-16 18:07:16,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:16,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255788982] [2020-01-16 18:07:16,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:16,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-01-16 18:07:16,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255788982] [2020-01-16 18:07:16,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:16,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:16,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679071364] [2020-01-16 18:07:16,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:16,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:16,832 INFO L87 Difference]: Start difference. First operand 801 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:07:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:16,993 INFO L93 Difference]: Finished difference Result 1471 states and 5113 transitions. [2020-01-16 18:07:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:16,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:16,997 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:07:16,998 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:07:16,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:07:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 796. [2020-01-16 18:07:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:07:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-01-16 18:07:17,021 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-01-16 18:07:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:17,021 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-01-16 18:07:17,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-01-16 18:07:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:17,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:17,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:17,022 INFO L426 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2139352457, now seen corresponding path program 429 times [2020-01-16 18:07:17,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:17,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007871040] [2020-01-16 18:07:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:17,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-01-16 18:07:17,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007871040] [2020-01-16 18:07:17,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:17,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:17,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836610526] [2020-01-16 18:07:17,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:17,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:17,484 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:07:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:17,649 INFO L93 Difference]: Finished difference Result 1478 states and 5127 transitions. [2020-01-16 18:07:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:17,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:17,654 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:07:17,654 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:07:17,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:07:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 803. [2020-01-16 18:07:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:07:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-01-16 18:07:17,679 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:17,679 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-01-16 18:07:17,680 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-01-16 18:07:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:17,681 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:17,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:17,681 INFO L426 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash 9444079, now seen corresponding path program 430 times [2020-01-16 18:07:17,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:17,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483407881] [2020-01-16 18:07:17,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:18,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-01-16 18:07:18,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483407881] [2020-01-16 18:07:18,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:18,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:18,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844953313] [2020-01-16 18:07:18,148 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:18,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:18,149 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:18,278 INFO L93 Difference]: Finished difference Result 1481 states and 5126 transitions. [2020-01-16 18:07:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:18,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:18,282 INFO L225 Difference]: With dead ends: 1481 [2020-01-16 18:07:18,282 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:07:18,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:07:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 796. [2020-01-16 18:07:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:07:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:07:18,304 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:07:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:18,304 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:07:18,304 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:07:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:18,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:18,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:18,306 INFO L426 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2107843145, now seen corresponding path program 431 times [2020-01-16 18:07:18,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:18,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611373372] [2020-01-16 18:07:18,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:18,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-01-16 18:07:18,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611373372] [2020-01-16 18:07:18,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:18,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:18,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266585015] [2020-01-16 18:07:18,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:18,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:18,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:18,803 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:07:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:18,951 INFO L93 Difference]: Finished difference Result 1475 states and 5114 transitions. [2020-01-16 18:07:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:18,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:18,954 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:07:18,955 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:07:18,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:07:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-01-16 18:07:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:07:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-01-16 18:07:18,977 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-01-16 18:07:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:18,978 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-01-16 18:07:18,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-01-16 18:07:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:18,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:18,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:18,979 INFO L426 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash -496902187, now seen corresponding path program 432 times [2020-01-16 18:07:18,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:18,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927587005] [2020-01-16 18:07:18,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:19,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927587005] [2020-01-16 18:07:19,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:19,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:19,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773137999] [2020-01-16 18:07:19,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:19,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:19,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:19,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:19,449 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:07:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:19,580 INFO L93 Difference]: Finished difference Result 1479 states and 5116 transitions. [2020-01-16 18:07:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:19,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:19,585 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:07:19,585 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:07:19,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:07:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 785. [2020-01-16 18:07:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:07:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3123 transitions. [2020-01-16 18:07:19,607 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3123 transitions. Word has length 25 [2020-01-16 18:07:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:19,607 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3123 transitions. [2020-01-16 18:07:19,607 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3123 transitions. [2020-01-16 18:07:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:19,608 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:19,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:19,609 INFO L426 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2039322317, now seen corresponding path program 433 times [2020-01-16 18:07:19,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:19,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469548641] [2020-01-16 18:07:19,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:20,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469548641] [2020-01-16 18:07:20,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:20,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:20,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046366588] [2020-01-16 18:07:20,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:20,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:20,063 INFO L87 Difference]: Start difference. First operand 785 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:07:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:20,243 INFO L93 Difference]: Finished difference Result 1464 states and 5108 transitions. [2020-01-16 18:07:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:20,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:20,247 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:07:20,247 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:07:20,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:07:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-01-16 18:07:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3171 transitions. [2020-01-16 18:07:20,269 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3171 transitions. Word has length 25 [2020-01-16 18:07:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:20,269 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3171 transitions. [2020-01-16 18:07:20,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3171 transitions. [2020-01-16 18:07:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:20,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:20,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:20,270 INFO L426 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1048064495, now seen corresponding path program 434 times [2020-01-16 18:07:20,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:20,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150370262] [2020-01-16 18:07:20,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:20,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-01-16 18:07:20,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150370262] [2020-01-16 18:07:20,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:20,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:20,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016735514] [2020-01-16 18:07:20,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:20,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:20,730 INFO L87 Difference]: Start difference. First operand 799 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:07:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:20,913 INFO L93 Difference]: Finished difference Result 1467 states and 5110 transitions. [2020-01-16 18:07:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:20,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:20,918 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:07:20,918 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:07:20,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:07:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-01-16 18:07:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3160 transitions. [2020-01-16 18:07:20,941 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3160 transitions. Word has length 25 [2020-01-16 18:07:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:20,942 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3160 transitions. [2020-01-16 18:07:20,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3160 transitions. [2020-01-16 18:07:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:20,943 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:20,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:20,943 INFO L426 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -113288239, now seen corresponding path program 435 times [2020-01-16 18:07:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:20,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383845328] [2020-01-16 18:07:20,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:21,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383845328] [2020-01-16 18:07:21,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:21,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:21,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326174299] [2020-01-16 18:07:21,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:21,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:21,411 INFO L87 Difference]: Start difference. First operand 795 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:07:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:21,604 INFO L93 Difference]: Finished difference Result 1462 states and 5100 transitions. [2020-01-16 18:07:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:21,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:21,607 INFO L225 Difference]: With dead ends: 1462 [2020-01-16 18:07:21,608 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:07:21,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:07:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 799. [2020-01-16 18:07:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-01-16 18:07:21,630 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:21,630 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-01-16 18:07:21,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-01-16 18:07:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:21,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:21,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:21,631 INFO L426 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 888472687, now seen corresponding path program 436 times [2020-01-16 18:07:21,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:21,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958297682] [2020-01-16 18:07:21,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:22,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958297682] [2020-01-16 18:07:22,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:22,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:22,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035464890] [2020-01-16 18:07:22,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:22,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:22,096 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:22,309 INFO L93 Difference]: Finished difference Result 1463 states and 5098 transitions. [2020-01-16 18:07:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:22,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:22,313 INFO L225 Difference]: With dead ends: 1463 [2020-01-16 18:07:22,313 INFO L226 Difference]: Without dead ends: 1445 [2020-01-16 18:07:22,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-01-16 18:07:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 795. [2020-01-16 18:07:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:07:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-01-16 18:07:22,335 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-01-16 18:07:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:22,335 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-01-16 18:07:22,335 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-01-16 18:07:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:22,336 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:22,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] [2020-01-16 18:07:22,337 INFO L426 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -58246861, now seen corresponding path program 437 times [2020-01-16 18:07:22,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:22,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096662965] [2020-01-16 18:07:22,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:22,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096662965] [2020-01-16 18:07:22,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:22,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:22,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122193026] [2020-01-16 18:07:22,791 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:22,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:22,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:22,791 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:07:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:22,940 INFO L93 Difference]: Finished difference Result 1469 states and 5111 transitions. [2020-01-16 18:07:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:22,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:22,944 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:07:22,944 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:07:22,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:07:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-01-16 18:07:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-01-16 18:07:22,967 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-01-16 18:07:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:22,967 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-01-16 18:07:22,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-01-16 18:07:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:22,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:22,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:22,969 INFO L426 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1552694097, now seen corresponding path program 438 times [2020-01-16 18:07:22,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:22,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038785146] [2020-01-16 18:07:22,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:23,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-01-16 18:07:23,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038785146] [2020-01-16 18:07:23,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:23,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:23,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585045261] [2020-01-16 18:07:23,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:23,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:23,423 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:07:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:23,593 INFO L93 Difference]: Finished difference Result 1467 states and 5102 transitions. [2020-01-16 18:07:23,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:23,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:23,597 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:07:23,598 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:07:23,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:07:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 791. [2020-01-16 18:07:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:07:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:07:23,621 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:07:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:23,621 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:07:23,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:07:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:23,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:23,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:23,622 INFO L426 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1833159253, now seen corresponding path program 439 times [2020-01-16 18:07:23,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:23,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805122593] [2020-01-16 18:07:23,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:24,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805122593] [2020-01-16 18:07:24,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:24,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:24,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393222155] [2020-01-16 18:07:24,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:24,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:24,085 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:07:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:24,248 INFO L93 Difference]: Finished difference Result 1475 states and 5127 transitions. [2020-01-16 18:07:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:24,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:24,252 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:07:24,252 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:07:24,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:07:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 801. [2020-01-16 18:07:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3172 transitions. [2020-01-16 18:07:24,275 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3172 transitions. Word has length 25 [2020-01-16 18:07:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:24,275 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3172 transitions. [2020-01-16 18:07:24,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3172 transitions. [2020-01-16 18:07:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:24,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:24,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] [2020-01-16 18:07:24,277 INFO L426 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1470550221, now seen corresponding path program 440 times [2020-01-16 18:07:24,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130504156] [2020-01-16 18:07:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:24,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-01-16 18:07:24,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130504156] [2020-01-16 18:07:24,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:24,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:24,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307037689] [2020-01-16 18:07:24,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:24,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:24,739 INFO L87 Difference]: Start difference. First operand 801 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:07:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:24,894 INFO L93 Difference]: Finished difference Result 1478 states and 5129 transitions. [2020-01-16 18:07:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:24,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:24,898 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:07:24,899 INFO L226 Difference]: Without dead ends: 1458 [2020-01-16 18:07:24,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-01-16 18:07:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 797. [2020-01-16 18:07:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:07:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-01-16 18:07:24,922 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-01-16 18:07:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:24,922 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-01-16 18:07:24,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-01-16 18:07:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:24,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:24,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:24,923 INFO L426 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1390260113, now seen corresponding path program 441 times [2020-01-16 18:07:24,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:24,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372181035] [2020-01-16 18:07:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:25,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372181035] [2020-01-16 18:07:25,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:25,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:25,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878193451] [2020-01-16 18:07:25,384 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:25,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:25,384 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-01-16 18:07:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:25,581 INFO L93 Difference]: Finished difference Result 1478 states and 5128 transitions. [2020-01-16 18:07:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:25,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:25,586 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:07:25,586 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:07:25,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:07:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 802. [2020-01-16 18:07:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:07:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3170 transitions. [2020-01-16 18:07:25,617 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3170 transitions. Word has length 25 [2020-01-16 18:07:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:25,618 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3170 transitions. [2020-01-16 18:07:25,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3170 transitions. [2020-01-16 18:07:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:25,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:25,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:25,619 INFO L426 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1892443153, now seen corresponding path program 442 times [2020-01-16 18:07:25,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:25,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809190153] [2020-01-16 18:07:25,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:26,004 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-01-16 18:07:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:26,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809190153] [2020-01-16 18:07:26,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:26,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:26,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675866527] [2020-01-16 18:07:26,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:26,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:26,117 INFO L87 Difference]: Start difference. First operand 802 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:07:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:26,251 INFO L93 Difference]: Finished difference Result 1483 states and 5133 transitions. [2020-01-16 18:07:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:26,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:26,255 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:07:26,255 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:07:26,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:07:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 797. [2020-01-16 18:07:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:07:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-01-16 18:07:26,278 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-01-16 18:07:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:26,278 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-01-16 18:07:26,278 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-01-16 18:07:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:26,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:26,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:26,279 INFO L426 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash -155136363, now seen corresponding path program 443 times [2020-01-16 18:07:26,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:26,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806944492] [2020-01-16 18:07:26,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:26,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806944492] [2020-01-16 18:07:26,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:26,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:26,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835875471] [2020-01-16 18:07:26,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:26,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:26,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:26,758 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:07:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:26,925 INFO L93 Difference]: Finished difference Result 1488 states and 5145 transitions. [2020-01-16 18:07:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:26,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:26,929 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:07:26,929 INFO L226 Difference]: Without dead ends: 1472 [2020-01-16 18:07:26,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2020-01-16 18:07:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 806. [2020-01-16 18:07:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:07:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3172 transitions. [2020-01-16 18:07:26,951 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3172 transitions. Word has length 25 [2020-01-16 18:07:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:26,952 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3172 transitions. [2020-01-16 18:07:26,952 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3172 transitions. [2020-01-16 18:07:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:26,953 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:26,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:26,953 INFO L426 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:26,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1228221743, now seen corresponding path program 444 times [2020-01-16 18:07:26,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:26,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21930008] [2020-01-16 18:07:26,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:27,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21930008] [2020-01-16 18:07:27,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:27,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:27,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641000607] [2020-01-16 18:07:27,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:27,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:27,437 INFO L87 Difference]: Start difference. First operand 806 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:07:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:27,596 INFO L93 Difference]: Finished difference Result 1490 states and 5141 transitions. [2020-01-16 18:07:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:27,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:27,600 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:07:27,600 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:07:27,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:07:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 791. [2020-01-16 18:07:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:07:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-01-16 18:07:27,623 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-01-16 18:07:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:27,623 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-01-16 18:07:27,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-01-16 18:07:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:27,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:27,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:27,624 INFO L426 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash -958259691, now seen corresponding path program 445 times [2020-01-16 18:07:27,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:27,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988628639] [2020-01-16 18:07:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:28,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988628639] [2020-01-16 18:07:28,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:28,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:28,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342403605] [2020-01-16 18:07:28,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:28,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:28,088 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:07:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:28,272 INFO L93 Difference]: Finished difference Result 1467 states and 5104 transitions. [2020-01-16 18:07:28,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:28,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:28,276 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:07:28,276 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:07:28,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:07:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 800. [2020-01-16 18:07:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3164 transitions. [2020-01-16 18:07:28,298 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3164 transitions. Word has length 25 [2020-01-16 18:07:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:28,299 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3164 transitions. [2020-01-16 18:07:28,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3164 transitions. [2020-01-16 18:07:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:28,300 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:28,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:28,300 INFO L426 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 43501235, now seen corresponding path program 446 times [2020-01-16 18:07:28,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:28,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705468437] [2020-01-16 18:07:28,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705468437] [2020-01-16 18:07:28,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:28,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:28,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326542484] [2020-01-16 18:07:28,773 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:28,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:28,773 INFO L87 Difference]: Start difference. First operand 800 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:07:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:28,947 INFO L93 Difference]: Finished difference Result 1468 states and 5102 transitions. [2020-01-16 18:07:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:28,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:28,951 INFO L225 Difference]: With dead ends: 1468 [2020-01-16 18:07:28,951 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:07:28,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:07:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 796. [2020-01-16 18:07:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:07:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-01-16 18:07:28,973 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-01-16 18:07:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:28,973 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-01-16 18:07:28,973 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-01-16 18:07:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:28,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:28,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:28,975 INFO L426 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:28,975 INFO L82 PathProgramCache]: Analyzing trace with hash 967774387, now seen corresponding path program 447 times [2020-01-16 18:07:28,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:28,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181848527] [2020-01-16 18:07:28,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:29,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181848527] [2020-01-16 18:07:29,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:29,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:29,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547332159] [2020-01-16 18:07:29,435 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:29,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:29,435 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:07:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:29,607 INFO L93 Difference]: Finished difference Result 1472 states and 5109 transitions. [2020-01-16 18:07:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:29,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:29,611 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:07:29,612 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:07:29,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:07:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 801. [2020-01-16 18:07:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-01-16 18:07:29,634 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-01-16 18:07:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:29,634 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-01-16 18:07:29,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-01-16 18:07:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:29,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:29,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] [2020-01-16 18:07:29,636 INFO L426 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1980038417, now seen corresponding path program 448 times [2020-01-16 18:07:29,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:29,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732955064] [2020-01-16 18:07:29,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:30,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732955064] [2020-01-16 18:07:30,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:30,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:30,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353734036] [2020-01-16 18:07:30,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:30,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:30,126 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:07:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:30,294 INFO L93 Difference]: Finished difference Result 1477 states and 5114 transitions. [2020-01-16 18:07:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:30,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:30,299 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:07:30,299 INFO L226 Difference]: Without dead ends: 1454 [2020-01-16 18:07:30,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-01-16 18:07:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-01-16 18:07:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:07:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:07:30,321 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:07:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:30,322 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:07:30,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:07:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:30,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:30,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:30,323 INFO L426 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1358915093, now seen corresponding path program 449 times [2020-01-16 18:07:30,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:30,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297598718] [2020-01-16 18:07:30,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:30,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297598718] [2020-01-16 18:07:30,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:30,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:30,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683349947] [2020-01-16 18:07:30,790 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:30,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:30,791 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:07:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:30,969 INFO L93 Difference]: Finished difference Result 1475 states and 5111 transitions. [2020-01-16 18:07:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:30,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:30,973 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:07:30,973 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:07:30,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:07:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-01-16 18:07:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:07:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-01-16 18:07:30,997 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-01-16 18:07:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:30,997 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-01-16 18:07:30,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-01-16 18:07:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:30,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:30,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] [2020-01-16 18:07:30,998 INFO L426 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1325111245, now seen corresponding path program 450 times [2020-01-16 18:07:30,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:30,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804873785] [2020-01-16 18:07:30,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:31,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804873785] [2020-01-16 18:07:31,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:31,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:31,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503064534] [2020-01-16 18:07:31,484 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:31,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:31,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:31,485 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-01-16 18:07:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:31,653 INFO L93 Difference]: Finished difference Result 1479 states and 5113 transitions. [2020-01-16 18:07:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:31,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:31,657 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:07:31,657 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:07:31,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:07:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 791. [2020-01-16 18:07:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:07:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-01-16 18:07:31,680 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-01-16 18:07:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:31,680 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-01-16 18:07:31,680 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-01-16 18:07:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:31,681 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:31,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:31,681 INFO L426 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2064877073, now seen corresponding path program 451 times [2020-01-16 18:07:31,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:31,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859317376] [2020-01-16 18:07:31,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:32,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859317376] [2020-01-16 18:07:32,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:32,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:32,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771850565] [2020-01-16 18:07:32,143 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:32,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:32,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:32,144 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:07:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:32,325 INFO L93 Difference]: Finished difference Result 1484 states and 5139 transitions. [2020-01-16 18:07:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:32,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:32,329 INFO L225 Difference]: With dead ends: 1484 [2020-01-16 18:07:32,329 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:07:32,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:07:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 803. [2020-01-16 18:07:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:07:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-01-16 18:07:32,352 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:32,352 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-01-16 18:07:32,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-01-16 18:07:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:32,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:32,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:32,353 INFO L426 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -619149265, now seen corresponding path program 452 times [2020-01-16 18:07:32,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:32,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737566548] [2020-01-16 18:07:32,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:32,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737566548] [2020-01-16 18:07:32,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:32,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:32,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157809100] [2020-01-16 18:07:32,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:32,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:32,818 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:33,007 INFO L93 Difference]: Finished difference Result 1482 states and 5130 transitions. [2020-01-16 18:07:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:33,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:33,011 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:07:33,012 INFO L226 Difference]: Without dead ends: 1463 [2020-01-16 18:07:33,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-01-16 18:07:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 798. [2020-01-16 18:07:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:07:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3153 transitions. [2020-01-16 18:07:33,034 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3153 transitions. Word has length 25 [2020-01-16 18:07:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:33,034 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3153 transitions. [2020-01-16 18:07:33,035 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3153 transitions. [2020-01-16 18:07:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:33,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:33,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] [2020-01-16 18:07:33,036 INFO L426 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash 464439219, now seen corresponding path program 453 times [2020-01-16 18:07:33,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:33,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125086434] [2020-01-16 18:07:33,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:33,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125086434] [2020-01-16 18:07:33,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:33,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:33,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7450328] [2020-01-16 18:07:33,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:33,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:33,508 INFO L87 Difference]: Start difference. First operand 798 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:07:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:33,685 INFO L93 Difference]: Finished difference Result 1492 states and 5150 transitions. [2020-01-16 18:07:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:33,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:33,689 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:07:33,689 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:07:33,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:07:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 807. [2020-01-16 18:07:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:07:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3169 transitions. [2020-01-16 18:07:33,711 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:33,712 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3169 transitions. [2020-01-16 18:07:33,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3169 transitions. [2020-01-16 18:07:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:33,713 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:33,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:33,713 INFO L426 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash -608646161, now seen corresponding path program 454 times [2020-01-16 18:07:33,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:33,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412150727] [2020-01-16 18:07:33,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:34,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412150727] [2020-01-16 18:07:34,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:34,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607642708] [2020-01-16 18:07:34,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:34,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:34,215 INFO L87 Difference]: Start difference. First operand 807 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:34,370 INFO L93 Difference]: Finished difference Result 1494 states and 5146 transitions. [2020-01-16 18:07:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:34,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:34,374 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:07:34,374 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:07:34,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:07:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 798. [2020-01-16 18:07:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:07:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-01-16 18:07:34,397 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-01-16 18:07:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:34,397 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-01-16 18:07:34,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-01-16 18:07:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:34,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:34,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:34,398 INFO L426 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash 474942323, now seen corresponding path program 455 times [2020-01-16 18:07:34,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:34,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108915639] [2020-01-16 18:07:34,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:34,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-01-16 18:07:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108915639] [2020-01-16 18:07:34,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:34,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:34,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873807347] [2020-01-16 18:07:34,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:34,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:34,863 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:07:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:35,052 INFO L93 Difference]: Finished difference Result 1485 states and 5128 transitions. [2020-01-16 18:07:35,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:35,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:35,057 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:07:35,057 INFO L226 Difference]: Without dead ends: 1471 [2020-01-16 18:07:35,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-01-16 18:07:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-01-16 18:07:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:07:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3157 transitions. [2020-01-16 18:07:35,079 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3157 transitions. Word has length 25 [2020-01-16 18:07:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:35,080 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3157 transitions. [2020-01-16 18:07:35,080 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3157 transitions. [2020-01-16 18:07:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:35,081 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:35,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:35,081 INFO L426 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2085883281, now seen corresponding path program 456 times [2020-01-16 18:07:35,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:35,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038681864] [2020-01-16 18:07:35,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:35,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038681864] [2020-01-16 18:07:35,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:35,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:35,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126788636] [2020-01-16 18:07:35,550 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:35,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:35,551 INFO L87 Difference]: Start difference. First operand 804 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:07:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:35,755 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-01-16 18:07:35,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:35,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:35,760 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:07:35,760 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:07:35,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:07:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 785. [2020-01-16 18:07:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:07:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-01-16 18:07:35,806 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-01-16 18:07:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:35,807 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-01-16 18:07:35,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-01-16 18:07:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:35,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:35,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:35,809 INFO L426 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -128929703, now seen corresponding path program 457 times [2020-01-16 18:07:35,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:35,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895900037] [2020-01-16 18:07:35,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:36,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895900037] [2020-01-16 18:07:36,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:36,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:36,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948179599] [2020-01-16 18:07:36,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:36,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:36,280 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:07:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:36,463 INFO L93 Difference]: Finished difference Result 1491 states and 5177 transitions. [2020-01-16 18:07:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:36,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:36,467 INFO L225 Difference]: With dead ends: 1491 [2020-01-16 18:07:36,467 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:07:36,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:07:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 805. [2020-01-16 18:07:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:07:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3181 transitions. [2020-01-16 18:07:36,490 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3181 transitions. Word has length 25 [2020-01-16 18:07:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:36,490 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3181 transitions. [2020-01-16 18:07:36,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3181 transitions. [2020-01-16 18:07:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:36,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:36,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:36,491 INFO L426 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1202015083, now seen corresponding path program 458 times [2020-01-16 18:07:36,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:36,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822107922] [2020-01-16 18:07:36,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:36,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822107922] [2020-01-16 18:07:36,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:36,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:36,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518466072] [2020-01-16 18:07:36,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:36,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:36,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:36,967 INFO L87 Difference]: Start difference. First operand 805 states and 3181 transitions. Second operand 10 states. [2020-01-16 18:07:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:37,135 INFO L93 Difference]: Finished difference Result 1492 states and 5173 transitions. [2020-01-16 18:07:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:37,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:37,139 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:07:37,140 INFO L226 Difference]: Without dead ends: 1470 [2020-01-16 18:07:37,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-01-16 18:07:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 799. [2020-01-16 18:07:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3165 transitions. [2020-01-16 18:07:37,162 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3165 transitions. Word has length 25 [2020-01-16 18:07:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:37,162 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3165 transitions. [2020-01-16 18:07:37,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3165 transitions. [2020-01-16 18:07:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:37,163 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:37,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:37,163 INFO L426 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367557, now seen corresponding path program 459 times [2020-01-16 18:07:37,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:37,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865327442] [2020-01-16 18:07:37,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:37,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865327442] [2020-01-16 18:07:37,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:37,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:37,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018543488] [2020-01-16 18:07:37,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:37,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:37,621 INFO L87 Difference]: Start difference. First operand 799 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:07:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:37,787 INFO L93 Difference]: Finished difference Result 1488 states and 5165 transitions. [2020-01-16 18:07:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:37,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:37,792 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:07:37,792 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:07:37,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:07:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 804. [2020-01-16 18:07:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:07:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-01-16 18:07:37,835 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-01-16 18:07:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:37,835 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-01-16 18:07:37,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-01-16 18:07:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:37,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:37,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] [2020-01-16 18:07:37,836 INFO L426 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1191511979, now seen corresponding path program 460 times [2020-01-16 18:07:37,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:37,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288619066] [2020-01-16 18:07:37,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:38,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288619066] [2020-01-16 18:07:38,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:38,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:38,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428209087] [2020-01-16 18:07:38,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:38,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:38,305 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-01-16 18:07:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:38,456 INFO L93 Difference]: Finished difference Result 1487 states and 5158 transitions. [2020-01-16 18:07:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:38,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:38,460 INFO L225 Difference]: With dead ends: 1487 [2020-01-16 18:07:38,460 INFO L226 Difference]: Without dead ends: 1468 [2020-01-16 18:07:38,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-01-16 18:07:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 799. [2020-01-16 18:07:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:07:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3160 transitions. [2020-01-16 18:07:38,484 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3160 transitions. Word has length 25 [2020-01-16 18:07:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:38,484 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3160 transitions. [2020-01-16 18:07:38,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3160 transitions. [2020-01-16 18:07:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:38,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:38,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:38,486 INFO L426 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1708361349, now seen corresponding path program 461 times [2020-01-16 18:07:38,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:38,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118571060] [2020-01-16 18:07:38,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:38,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118571060] [2020-01-16 18:07:38,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:38,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:38,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271708383] [2020-01-16 18:07:38,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:38,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:38,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:38,946 INFO L87 Difference]: Start difference. First operand 799 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:07:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:39,122 INFO L93 Difference]: Finished difference Result 1490 states and 5164 transitions. [2020-01-16 18:07:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:39,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:39,126 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:07:39,126 INFO L226 Difference]: Without dead ends: 1474 [2020-01-16 18:07:39,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-01-16 18:07:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 804. [2020-01-16 18:07:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:07:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3169 transitions. [2020-01-16 18:07:39,148 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:39,149 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3169 transitions. [2020-01-16 18:07:39,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3169 transitions. [2020-01-16 18:07:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:39,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:39,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] [2020-01-16 18:07:39,150 INFO L426 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash -97420391, now seen corresponding path program 462 times [2020-01-16 18:07:39,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:39,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358203505] [2020-01-16 18:07:39,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:39,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358203505] [2020-01-16 18:07:39,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:39,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:39,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152177612] [2020-01-16 18:07:39,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:39,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:39,614 INFO L87 Difference]: Start difference. First operand 804 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:39,772 INFO L93 Difference]: Finished difference Result 1488 states and 5155 transitions. [2020-01-16 18:07:39,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:39,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:39,776 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:07:39,776 INFO L226 Difference]: Without dead ends: 1464 [2020-01-16 18:07:39,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-01-16 18:07:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 794. [2020-01-16 18:07:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:07:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:07:39,799 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:07:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:39,800 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:07:39,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:07:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:39,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:39,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:39,801 INFO L426 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1797104375, now seen corresponding path program 463 times [2020-01-16 18:07:39,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:39,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007343775] [2020-01-16 18:07:39,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:40,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007343775] [2020-01-16 18:07:40,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:40,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:40,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009626098] [2020-01-16 18:07:40,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:40,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:40,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:40,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:40,277 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:07:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:40,438 INFO L93 Difference]: Finished difference Result 1505 states and 5203 transitions. [2020-01-16 18:07:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:40,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:40,442 INFO L225 Difference]: With dead ends: 1505 [2020-01-16 18:07:40,443 INFO L226 Difference]: Without dead ends: 1490 [2020-01-16 18:07:40,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-01-16 18:07:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 809. [2020-01-16 18:07:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-01-16 18:07:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 3186 transitions. [2020-01-16 18:07:40,466 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 3186 transitions. Word has length 25 [2020-01-16 18:07:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:40,466 INFO L478 AbstractCegarLoop]: Abstraction has 809 states and 3186 transitions. [2020-01-16 18:07:40,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 3186 transitions. [2020-01-16 18:07:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:40,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:40,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:40,468 INFO L426 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash 724018995, now seen corresponding path program 464 times [2020-01-16 18:07:40,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:40,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126181242] [2020-01-16 18:07:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:40,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-01-16 18:07:40,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126181242] [2020-01-16 18:07:40,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:40,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:40,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424432518] [2020-01-16 18:07:40,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:40,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:40,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:40,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:40,942 INFO L87 Difference]: Start difference. First operand 809 states and 3186 transitions. Second operand 10 states. [2020-01-16 18:07:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:41,113 INFO L93 Difference]: Finished difference Result 1506 states and 5199 transitions. [2020-01-16 18:07:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:41,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:41,117 INFO L225 Difference]: With dead ends: 1506 [2020-01-16 18:07:41,118 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:07:41,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:07:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 803. [2020-01-16 18:07:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:07:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3169 transitions. [2020-01-16 18:07:41,141 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:41,141 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3169 transitions. [2020-01-16 18:07:41,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3169 transitions. [2020-01-16 18:07:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:41,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:41,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:41,142 INFO L426 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1403771333, now seen corresponding path program 465 times [2020-01-16 18:07:41,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:41,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574129493] [2020-01-16 18:07:41,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:41,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574129493] [2020-01-16 18:07:41,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:41,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:41,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810132385] [2020-01-16 18:07:41,625 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:41,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:41,625 INFO L87 Difference]: Start difference. First operand 803 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:41,775 INFO L93 Difference]: Finished difference Result 1508 states and 5202 transitions. [2020-01-16 18:07:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:41,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:41,779 INFO L225 Difference]: With dead ends: 1508 [2020-01-16 18:07:41,779 INFO L226 Difference]: Without dead ends: 1493 [2020-01-16 18:07:41,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-01-16 18:07:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 810. [2020-01-16 18:07:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:07:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3182 transitions. [2020-01-16 18:07:41,821 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3182 transitions. Word has length 25 [2020-01-16 18:07:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:41,821 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3182 transitions. [2020-01-16 18:07:41,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3182 transitions. [2020-01-16 18:07:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:41,822 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:41,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:41,822 INFO L426 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash 745025203, now seen corresponding path program 466 times [2020-01-16 18:07:41,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:41,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663490450] [2020-01-16 18:07:41,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:42,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-01-16 18:07:42,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663490450] [2020-01-16 18:07:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:42,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971460148] [2020-01-16 18:07:42,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:42,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:42,308 INFO L87 Difference]: Start difference. First operand 810 states and 3182 transitions. Second operand 10 states. [2020-01-16 18:07:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:42,447 INFO L93 Difference]: Finished difference Result 1511 states and 5201 transitions. [2020-01-16 18:07:42,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:42,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:42,451 INFO L225 Difference]: With dead ends: 1511 [2020-01-16 18:07:42,451 INFO L226 Difference]: Without dead ends: 1486 [2020-01-16 18:07:42,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-01-16 18:07:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 803. [2020-01-16 18:07:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:07:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3162 transitions. [2020-01-16 18:07:42,474 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3162 transitions. Word has length 25 [2020-01-16 18:07:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:42,474 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3162 transitions. [2020-01-16 18:07:42,474 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3162 transitions. [2020-01-16 18:07:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:42,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:42,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:42,475 INFO L426 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1382765125, now seen corresponding path program 467 times [2020-01-16 18:07:42,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:42,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557653832] [2020-01-16 18:07:42,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:42,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557653832] [2020-01-16 18:07:42,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:42,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:42,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967660068] [2020-01-16 18:07:42,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:42,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:42,957 INFO L87 Difference]: Start difference. First operand 803 states and 3162 transitions. Second operand 10 states. [2020-01-16 18:07:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:43,112 INFO L93 Difference]: Finished difference Result 1512 states and 5203 transitions. [2020-01-16 18:07:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:43,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:43,116 INFO L225 Difference]: With dead ends: 1512 [2020-01-16 18:07:43,116 INFO L226 Difference]: Without dead ends: 1496 [2020-01-16 18:07:43,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-01-16 18:07:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 812. [2020-01-16 18:07:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-01-16 18:07:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 3178 transitions. [2020-01-16 18:07:43,139 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 3178 transitions. Word has length 25 [2020-01-16 18:07:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:43,139 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 3178 transitions. [2020-01-16 18:07:43,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 3178 transitions. [2020-01-16 18:07:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:43,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:43,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:43,140 INFO L426 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1839116791, now seen corresponding path program 468 times [2020-01-16 18:07:43,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:43,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950792008] [2020-01-16 18:07:43,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:43,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950792008] [2020-01-16 18:07:43,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:43,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:43,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291219154] [2020-01-16 18:07:43,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:43,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:43,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:43,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:43,631 INFO L87 Difference]: Start difference. First operand 812 states and 3178 transitions. Second operand 10 states. [2020-01-16 18:07:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:43,785 INFO L93 Difference]: Finished difference Result 1514 states and 5199 transitions. [2020-01-16 18:07:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:43,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:43,789 INFO L225 Difference]: With dead ends: 1514 [2020-01-16 18:07:43,789 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:07:43,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:07:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 794. [2020-01-16 18:07:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:07:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-01-16 18:07:43,811 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-01-16 18:07:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:43,812 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-01-16 18:07:43,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-01-16 18:07:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:43,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:43,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:43,813 INFO L426 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700599, now seen corresponding path program 469 times [2020-01-16 18:07:43,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:43,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49951556] [2020-01-16 18:07:43,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:44,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-01-16 18:07:44,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49951556] [2020-01-16 18:07:44,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:44,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:44,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521615874] [2020-01-16 18:07:44,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:44,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:44,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:44,283 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:07:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:44,470 INFO L93 Difference]: Finished difference Result 1493 states and 5167 transitions. [2020-01-16 18:07:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:44,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:44,473 INFO L225 Difference]: With dead ends: 1493 [2020-01-16 18:07:44,474 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:07:44,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:07:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 805. [2020-01-16 18:07:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:07:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3169 transitions. [2020-01-16 18:07:44,496 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3169 transitions. Word has length 25 [2020-01-16 18:07:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:44,496 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3169 transitions. [2020-01-16 18:07:44,496 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3169 transitions. [2020-01-16 18:07:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:44,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:44,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:44,497 INFO L426 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1634411119, now seen corresponding path program 470 times [2020-01-16 18:07:44,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:44,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686784527] [2020-01-16 18:07:44,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:44,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686784527] [2020-01-16 18:07:44,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:44,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:44,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15941333] [2020-01-16 18:07:44,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:44,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:44,967 INFO L87 Difference]: Start difference. First operand 805 states and 3169 transitions. Second operand 10 states. [2020-01-16 18:07:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:45,124 INFO L93 Difference]: Finished difference Result 1492 states and 5160 transitions. [2020-01-16 18:07:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:45,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:45,128 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:07:45,128 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:07:45,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:07:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 800. [2020-01-16 18:07:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3155 transitions. [2020-01-16 18:07:45,150 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3155 transitions. Word has length 25 [2020-01-16 18:07:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:45,151 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3155 transitions. [2020-01-16 18:07:45,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3155 transitions. [2020-01-16 18:07:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:45,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:45,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:45,152 INFO L426 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash 522262745, now seen corresponding path program 471 times [2020-01-16 18:07:45,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:45,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349476601] [2020-01-16 18:07:45,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:45,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349476601] [2020-01-16 18:07:45,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:45,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:45,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897302693] [2020-01-16 18:07:45,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:45,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:45,627 INFO L87 Difference]: Start difference. First operand 800 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:07:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:45,780 INFO L93 Difference]: Finished difference Result 1499 states and 5174 transitions. [2020-01-16 18:07:45,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:45,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:45,784 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:07:45,785 INFO L226 Difference]: Without dead ends: 1484 [2020-01-16 18:07:45,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-01-16 18:07:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 807. [2020-01-16 18:07:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:07:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3168 transitions. [2020-01-16 18:07:45,828 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3168 transitions. Word has length 25 [2020-01-16 18:07:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:45,828 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3168 transitions. [2020-01-16 18:07:45,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3168 transitions. [2020-01-16 18:07:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:45,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:45,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:45,830 INFO L426 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1623908015, now seen corresponding path program 472 times [2020-01-16 18:07:45,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:45,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53163133] [2020-01-16 18:07:45,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:46,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53163133] [2020-01-16 18:07:46,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:46,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:46,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889393512] [2020-01-16 18:07:46,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:46,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:46,300 INFO L87 Difference]: Start difference. First operand 807 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:07:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:46,458 INFO L93 Difference]: Finished difference Result 1502 states and 5173 transitions. [2020-01-16 18:07:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:46,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:46,462 INFO L225 Difference]: With dead ends: 1502 [2020-01-16 18:07:46,462 INFO L226 Difference]: Without dead ends: 1477 [2020-01-16 18:07:46,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-01-16 18:07:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 800. [2020-01-16 18:07:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:07:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3149 transitions. [2020-01-16 18:07:46,484 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3149 transitions. Word has length 25 [2020-01-16 18:07:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:46,485 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3149 transitions. [2020-01-16 18:07:46,485 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3149 transitions. [2020-01-16 18:07:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:46,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:46,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] [2020-01-16 18:07:46,486 INFO L426 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash 553772057, now seen corresponding path program 473 times [2020-01-16 18:07:46,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:46,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030772962] [2020-01-16 18:07:46,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:46,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030772962] [2020-01-16 18:07:46,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:46,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:46,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164245412] [2020-01-16 18:07:46,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:46,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:46,968 INFO L87 Difference]: Start difference. First operand 800 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:07:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:47,131 INFO L93 Difference]: Finished difference Result 1496 states and 5161 transitions. [2020-01-16 18:07:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:47,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:47,135 INFO L225 Difference]: With dead ends: 1496 [2020-01-16 18:07:47,135 INFO L226 Difference]: Without dead ends: 1482 [2020-01-16 18:07:47,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-01-16 18:07:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 806. [2020-01-16 18:07:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:07:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3160 transitions. [2020-01-16 18:07:47,157 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3160 transitions. Word has length 25 [2020-01-16 18:07:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:47,157 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3160 transitions. [2020-01-16 18:07:47,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3160 transitions. [2020-01-16 18:07:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:47,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:47,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:47,159 INFO L426 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2130254281, now seen corresponding path program 474 times [2020-01-16 18:07:47,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:47,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098617918] [2020-01-16 18:07:47,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:47,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098617918] [2020-01-16 18:07:47,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:47,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:47,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980663491] [2020-01-16 18:07:47,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:47,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:47,640 INFO L87 Difference]: Start difference. First operand 806 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:07:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:47,772 INFO L93 Difference]: Finished difference Result 1500 states and 5163 transitions. [2020-01-16 18:07:47,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:47,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:47,776 INFO L225 Difference]: With dead ends: 1500 [2020-01-16 18:07:47,776 INFO L226 Difference]: Without dead ends: 1470 [2020-01-16 18:07:47,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-01-16 18:07:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 794. [2020-01-16 18:07:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:07:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3132 transitions. [2020-01-16 18:07:47,799 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3132 transitions. Word has length 25 [2020-01-16 18:07:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:47,799 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3132 transitions. [2020-01-16 18:07:47,799 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3132 transitions. [2020-01-16 18:07:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:47,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:47,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:47,801 INFO L426 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1700807667, now seen corresponding path program 475 times [2020-01-16 18:07:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:47,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939855908] [2020-01-16 18:07:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:48,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939855908] [2020-01-16 18:07:48,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:48,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:48,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525913591] [2020-01-16 18:07:48,272 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:48,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:48,272 INFO L87 Difference]: Start difference. First operand 794 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:07:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:48,455 INFO L93 Difference]: Finished difference Result 1499 states and 5173 transitions. [2020-01-16 18:07:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:48,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:48,459 INFO L225 Difference]: With dead ends: 1499 [2020-01-16 18:07:48,459 INFO L226 Difference]: Without dead ends: 1483 [2020-01-16 18:07:48,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2020-01-16 18:07:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 806. [2020-01-16 18:07:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-01-16 18:07:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3165 transitions. [2020-01-16 18:07:48,482 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3165 transitions. Word has length 25 [2020-01-16 18:07:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:48,482 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 3165 transitions. [2020-01-16 18:07:48,482 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3165 transitions. [2020-01-16 18:07:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:48,483 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:48,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] [2020-01-16 18:07:48,484 INFO L426 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash -983218671, now seen corresponding path program 476 times [2020-01-16 18:07:48,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:48,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754316494] [2020-01-16 18:07:48,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:48,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754316494] [2020-01-16 18:07:48,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:48,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576188955] [2020-01-16 18:07:48,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:48,954 INFO L87 Difference]: Start difference. First operand 806 states and 3165 transitions. Second operand 10 states. [2020-01-16 18:07:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:49,166 INFO L93 Difference]: Finished difference Result 1497 states and 5164 transitions. [2020-01-16 18:07:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:49,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:49,170 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:07:49,170 INFO L226 Difference]: Without dead ends: 1478 [2020-01-16 18:07:49,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-01-16 18:07:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 801. [2020-01-16 18:07:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-01-16 18:07:49,193 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-01-16 18:07:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:49,193 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-01-16 18:07:49,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-01-16 18:07:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:49,194 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:49,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:49,194 INFO L426 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 100369813, now seen corresponding path program 477 times [2020-01-16 18:07:49,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:49,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38294118] [2020-01-16 18:07:49,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:49,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38294118] [2020-01-16 18:07:49,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:49,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:49,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583080839] [2020-01-16 18:07:49,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:49,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:49,675 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:07:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:49,904 INFO L93 Difference]: Finished difference Result 1507 states and 5184 transitions. [2020-01-16 18:07:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:49,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:49,908 INFO L225 Difference]: With dead ends: 1507 [2020-01-16 18:07:49,909 INFO L226 Difference]: Without dead ends: 1491 [2020-01-16 18:07:49,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2020-01-16 18:07:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 810. [2020-01-16 18:07:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:07:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-01-16 18:07:49,931 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-01-16 18:07:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:49,931 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-01-16 18:07:49,931 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-01-16 18:07:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:49,932 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:49,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:49,932 INFO L426 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash -972715567, now seen corresponding path program 478 times [2020-01-16 18:07:49,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:49,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889071307] [2020-01-16 18:07:49,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:50,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-01-16 18:07:50,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889071307] [2020-01-16 18:07:50,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:50,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:50,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612233339] [2020-01-16 18:07:50,416 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:50,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:50,417 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:07:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:50,596 INFO L93 Difference]: Finished difference Result 1509 states and 5180 transitions. [2020-01-16 18:07:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:50,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:50,601 INFO L225 Difference]: With dead ends: 1509 [2020-01-16 18:07:50,601 INFO L226 Difference]: Without dead ends: 1482 [2020-01-16 18:07:50,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-01-16 18:07:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 801. [2020-01-16 18:07:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:07:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3144 transitions. [2020-01-16 18:07:50,624 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3144 transitions. Word has length 25 [2020-01-16 18:07:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:50,624 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3144 transitions. [2020-01-16 18:07:50,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3144 transitions. [2020-01-16 18:07:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:50,626 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:50,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:50,626 INFO L426 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 110872917, now seen corresponding path program 479 times [2020-01-16 18:07:50,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:50,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108703228] [2020-01-16 18:07:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:51,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-01-16 18:07:51,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108703228] [2020-01-16 18:07:51,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:51,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:51,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808750507] [2020-01-16 18:07:51,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:51,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:51,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:51,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:51,099 INFO L87 Difference]: Start difference. First operand 801 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:07:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:51,311 INFO L93 Difference]: Finished difference Result 1500 states and 5162 transitions. [2020-01-16 18:07:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:51,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:51,314 INFO L225 Difference]: With dead ends: 1500 [2020-01-16 18:07:51,315 INFO L226 Difference]: Without dead ends: 1486 [2020-01-16 18:07:51,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-01-16 18:07:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 807. [2020-01-16 18:07:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:07:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3155 transitions. [2020-01-16 18:07:51,337 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3155 transitions. Word has length 25 [2020-01-16 18:07:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:51,337 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3155 transitions. [2020-01-16 18:07:51,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3155 transitions. [2020-01-16 18:07:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:51,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:51,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] [2020-01-16 18:07:51,339 INFO L426 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1721813875, now seen corresponding path program 480 times [2020-01-16 18:07:51,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:51,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747726084] [2020-01-16 18:07:51,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:51,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747726084] [2020-01-16 18:07:51,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:51,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:51,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934881577] [2020-01-16 18:07:51,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:51,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:51,826 INFO L87 Difference]: Start difference. First operand 807 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:07:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:51,971 INFO L93 Difference]: Finished difference Result 1504 states and 5164 transitions. [2020-01-16 18:07:51,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:51,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:51,976 INFO L225 Difference]: With dead ends: 1504 [2020-01-16 18:07:51,976 INFO L226 Difference]: Without dead ends: 1455 [2020-01-16 18:07:51,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-01-16 18:07:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 776. [2020-01-16 18:07:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:07:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:07:52,001 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:07:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:52,001 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:07:52,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:07:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:52,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:52,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:52,002 INFO L426 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash -470807655, now seen corresponding path program 481 times [2020-01-16 18:07:52,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:52,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966913965] [2020-01-16 18:07:52,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:52,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966913965] [2020-01-16 18:07:52,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:52,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:52,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158910410] [2020-01-16 18:07:52,459 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:52,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:52,460 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:07:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:52,671 INFO L93 Difference]: Finished difference Result 1389 states and 4892 transitions. [2020-01-16 18:07:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:52,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:52,675 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:07:52,675 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:07:52,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:07:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-01-16 18:07:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3149 transitions. [2020-01-16 18:07:52,697 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3149 transitions. Word has length 25 [2020-01-16 18:07:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:52,697 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3149 transitions. [2020-01-16 18:07:52,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3149 transitions. [2020-01-16 18:07:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:52,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:52,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] [2020-01-16 18:07:52,698 INFO L426 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 509947063, now seen corresponding path program 482 times [2020-01-16 18:07:52,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:52,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898857350] [2020-01-16 18:07:52,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:53,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898857350] [2020-01-16 18:07:53,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:53,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:53,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910633317] [2020-01-16 18:07:53,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:53,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:53,153 INFO L87 Difference]: Start difference. First operand 790 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:07:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:53,320 INFO L93 Difference]: Finished difference Result 1388 states and 4887 transitions. [2020-01-16 18:07:53,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:53,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:53,324 INFO L225 Difference]: With dead ends: 1388 [2020-01-16 18:07:53,324 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:07:53,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:07:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:07:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:07:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-01-16 18:07:53,346 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-01-16 18:07:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:53,346 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-01-16 18:07:53,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-01-16 18:07:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:53,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:53,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:53,347 INFO L426 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1455226423, now seen corresponding path program 483 times [2020-01-16 18:07:53,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:53,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742780774] [2020-01-16 18:07:53,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:53,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-01-16 18:07:53,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742780774] [2020-01-16 18:07:53,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:53,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220984071] [2020-01-16 18:07:53,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:53,812 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:07:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:53,981 INFO L93 Difference]: Finished difference Result 1394 states and 4900 transitions. [2020-01-16 18:07:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:53,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:53,985 INFO L225 Difference]: With dead ends: 1394 [2020-01-16 18:07:53,985 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:07:53,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:07:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 791. [2020-01-16 18:07:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:07:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3148 transitions. [2020-01-16 18:07:54,008 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3148 transitions. Word has length 25 [2020-01-16 18:07:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:54,008 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3148 transitions. [2020-01-16 18:07:54,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3148 transitions. [2020-01-16 18:07:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:54,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:54,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:54,009 INFO L426 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1848483051, now seen corresponding path program 484 times [2020-01-16 18:07:54,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:54,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978991697] [2020-01-16 18:07:54,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:54,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978991697] [2020-01-16 18:07:54,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:54,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303492383] [2020-01-16 18:07:54,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:54,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:54,452 INFO L87 Difference]: Start difference. First operand 791 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:07:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:54,663 INFO L93 Difference]: Finished difference Result 1397 states and 4902 transitions. [2020-01-16 18:07:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:54,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:54,667 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:07:54,668 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:07:54,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:07:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 787. [2020-01-16 18:07:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:07:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:07:54,690 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:07:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:54,690 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:07:54,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:07:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:54,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:54,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:54,691 INFO L426 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1174168473, now seen corresponding path program 485 times [2020-01-16 18:07:54,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:54,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117136920] [2020-01-16 18:07:54,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:55,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-01-16 18:07:55,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117136920] [2020-01-16 18:07:55,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:55,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:55,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586558798] [2020-01-16 18:07:55,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:55,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:55,137 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:07:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:55,303 INFO L93 Difference]: Finished difference Result 1391 states and 4890 transitions. [2020-01-16 18:07:55,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:55,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:55,308 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:07:55,308 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:07:55,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:07:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-01-16 18:07:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-01-16 18:07:55,331 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-01-16 18:07:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:55,331 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-01-16 18:07:55,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-01-16 18:07:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:55,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:55,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:55,332 INFO L426 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1509857865, now seen corresponding path program 486 times [2020-01-16 18:07:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808536574] [2020-01-16 18:07:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:55,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808536574] [2020-01-16 18:07:55,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:55,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:55,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619589670] [2020-01-16 18:07:55,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:55,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:55,776 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:07:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:55,982 INFO L93 Difference]: Finished difference Result 1395 states and 4895 transitions. [2020-01-16 18:07:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:55,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:55,986 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:07:55,986 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:07:55,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:07:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 784. [2020-01-16 18:07:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:07:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-01-16 18:07:56,008 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-01-16 18:07:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:56,008 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-01-16 18:07:56,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-01-16 18:07:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:56,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:56,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:56,009 INFO L426 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -893293381, now seen corresponding path program 487 times [2020-01-16 18:07:56,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:56,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048259723] [2020-01-16 18:07:56,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:56,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048259723] [2020-01-16 18:07:56,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:56,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:56,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455606596] [2020-01-16 18:07:56,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:56,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:56,469 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:07:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:56,671 INFO L93 Difference]: Finished difference Result 1387 states and 4885 transitions. [2020-01-16 18:07:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:56,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:56,676 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:07:56,676 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:07:56,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:07:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-01-16 18:07:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-01-16 18:07:56,698 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-01-16 18:07:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:56,699 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-01-16 18:07:56,699 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-01-16 18:07:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:56,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:56,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:56,700 INFO L426 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash 87461337, now seen corresponding path program 488 times [2020-01-16 18:07:56,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:56,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590074757] [2020-01-16 18:07:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:57,171 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:07:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:57,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590074757] [2020-01-16 18:07:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781242593] [2020-01-16 18:07:57,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:57,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:57,179 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:07:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:57,384 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-01-16 18:07:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:57,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:57,388 INFO L225 Difference]: With dead ends: 1386 [2020-01-16 18:07:57,388 INFO L226 Difference]: Without dead ends: 1371 [2020-01-16 18:07:57,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-01-16 18:07:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-01-16 18:07:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:07:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-01-16 18:07:57,410 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-01-16 18:07:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:57,410 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-01-16 18:07:57,410 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-01-16 18:07:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:57,411 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:57,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] [2020-01-16 18:07:57,412 INFO L426 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1336192521, now seen corresponding path program 489 times [2020-01-16 18:07:57,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:57,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797260737] [2020-01-16 18:07:57,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:57,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797260737] [2020-01-16 18:07:57,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:57,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:57,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563942573] [2020-01-16 18:07:57,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:57,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:57,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:57,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:57,865 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:07:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:58,071 INFO L93 Difference]: Finished difference Result 1390 states and 4889 transitions. [2020-01-16 18:07:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:58,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:58,076 INFO L225 Difference]: With dead ends: 1390 [2020-01-16 18:07:58,076 INFO L226 Difference]: Without dead ends: 1377 [2020-01-16 18:07:58,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-01-16 18:07:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 791. [2020-01-16 18:07:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:07:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:07:58,100 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:07:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:58,100 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:07:58,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:07:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:58,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:58,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:58,102 INFO L426 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash -334431595, now seen corresponding path program 490 times [2020-01-16 18:07:58,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204052224] [2020-01-16 18:07:58,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:58,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204052224] [2020-01-16 18:07:58,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:58,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:58,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168188196] [2020-01-16 18:07:58,558 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:58,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:58,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:58,558 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:07:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:58,728 INFO L93 Difference]: Finished difference Result 1391 states and 4887 transitions. [2020-01-16 18:07:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:58,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:58,732 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:07:58,732 INFO L226 Difference]: Without dead ends: 1373 [2020-01-16 18:07:58,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-01-16 18:07:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-01-16 18:07:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:07:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-01-16 18:07:58,754 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-01-16 18:07:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:58,754 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-01-16 18:07:58,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-01-16 18:07:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:58,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:58,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:58,755 INFO L426 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1077278971, now seen corresponding path program 491 times [2020-01-16 18:07:58,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:58,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809750783] [2020-01-16 18:07:58,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:59,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809750783] [2020-01-16 18:07:59,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:59,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:59,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981312097] [2020-01-16 18:07:59,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:59,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:59,211 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:07:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:07:59,374 INFO L93 Difference]: Finished difference Result 1387 states and 4879 transitions. [2020-01-16 18:07:59,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:07:59,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:07:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:07:59,378 INFO L225 Difference]: With dead ends: 1387 [2020-01-16 18:07:59,378 INFO L226 Difference]: Without dead ends: 1375 [2020-01-16 18:07:59,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:07:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-01-16 18:07:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 790. [2020-01-16 18:07:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:07:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:07:59,401 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:07:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:07:59,401 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:07:59,401 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:07:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:07:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:07:59,402 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:07:59,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:07:59,402 INFO L426 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:07:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:07:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash 4193591, now seen corresponding path program 492 times [2020-01-16 18:07:59,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:07:59,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322072897] [2020-01-16 18:07:59,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:07:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:07:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:07:59,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322072897] [2020-01-16 18:07:59,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:07:59,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:07:59,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715089444] [2020-01-16 18:07:59,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:07:59,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:07:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:07:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:07:59,854 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:08:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:00,044 INFO L93 Difference]: Finished difference Result 1389 states and 4880 transitions. [2020-01-16 18:08:00,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:00,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:00,048 INFO L225 Difference]: With dead ends: 1389 [2020-01-16 18:08:00,048 INFO L226 Difference]: Without dead ends: 1369 [2020-01-16 18:08:00,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-01-16 18:08:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 784. [2020-01-16 18:08:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:08:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-01-16 18:08:00,070 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-01-16 18:08:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:00,070 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-01-16 18:08:00,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-01-16 18:08:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:00,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:00,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:00,072 INFO L426 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:00,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:00,072 INFO L82 PathProgramCache]: Analyzing trace with hash 610254971, now seen corresponding path program 493 times [2020-01-16 18:08:00,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:00,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779732640] [2020-01-16 18:08:00,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:00,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-01-16 18:08:00,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779732640] [2020-01-16 18:08:00,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:00,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:00,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649443561] [2020-01-16 18:08:00,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:00,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:00,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:00,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:00,510 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:08:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:00,727 INFO L93 Difference]: Finished difference Result 1400 states and 4914 transitions. [2020-01-16 18:08:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:00,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:00,731 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:08:00,731 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:08:00,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:08:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 792. [2020-01-16 18:08:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:08:00,753 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:08:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:00,753 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:08:00,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:08:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:00,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:00,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:00,755 INFO L426 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1601512793, now seen corresponding path program 494 times [2020-01-16 18:08:00,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:00,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128140897] [2020-01-16 18:08:00,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:01,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128140897] [2020-01-16 18:08:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:01,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:01,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857587515] [2020-01-16 18:08:01,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:01,194 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:08:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:01,359 INFO L93 Difference]: Finished difference Result 1403 states and 4916 transitions. [2020-01-16 18:08:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:01,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:01,363 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:08:01,363 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:08:01,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:08:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-01-16 18:08:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:08:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-01-16 18:08:01,385 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-01-16 18:08:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:01,385 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-01-16 18:08:01,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-01-16 18:08:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:01,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:01,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:01,386 INFO L426 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1758678247, now seen corresponding path program 495 times [2020-01-16 18:08:01,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:01,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147805438] [2020-01-16 18:08:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:01,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147805438] [2020-01-16 18:08:01,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:01,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:01,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260298875] [2020-01-16 18:08:01,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:01,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:01,830 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:08:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:02,003 INFO L93 Difference]: Finished difference Result 1398 states and 4906 transitions. [2020-01-16 18:08:02,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:02,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:02,007 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:08:02,007 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:08:02,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:08:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-01-16 18:08:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:08:02,029 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:02,029 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:08:02,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:08:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:02,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:02,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] [2020-01-16 18:08:02,030 INFO L426 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash -756917321, now seen corresponding path program 496 times [2020-01-16 18:08:02,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:02,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119265639] [2020-01-16 18:08:02,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:02,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119265639] [2020-01-16 18:08:02,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:02,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:02,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458198448] [2020-01-16 18:08:02,478 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:02,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:02,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:02,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:02,478 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:02,647 INFO L93 Difference]: Finished difference Result 1399 states and 4904 transitions. [2020-01-16 18:08:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:02,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:02,651 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:08:02,652 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:08:02,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:08:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 788. [2020-01-16 18:08:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:08:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:08:02,673 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:08:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:02,674 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:08:02,674 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:08:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:02,675 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:02,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:02,675 INFO L426 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1703636869, now seen corresponding path program 497 times [2020-01-16 18:08:02,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:02,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253181425] [2020-01-16 18:08:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:03,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253181425] [2020-01-16 18:08:03,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:03,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:03,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827551357] [2020-01-16 18:08:03,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:03,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:03,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:03,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:03,112 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:08:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:03,258 INFO L93 Difference]: Finished difference Result 1405 states and 4917 transitions. [2020-01-16 18:08:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:03,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:03,262 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:08:03,262 INFO L226 Difference]: Without dead ends: 1389 [2020-01-16 18:08:03,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-01-16 18:08:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-01-16 18:08:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-01-16 18:08:03,284 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-01-16 18:08:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:03,284 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-01-16 18:08:03,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-01-16 18:08:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:03,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:03,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:03,285 INFO L426 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -92695911, now seen corresponding path program 498 times [2020-01-16 18:08:03,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:03,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627842459] [2020-01-16 18:08:03,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:03,741 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:08:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:03,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627842459] [2020-01-16 18:08:03,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:03,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:03,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104101204] [2020-01-16 18:08:03,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:03,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:03,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:03,748 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:08:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:03,895 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-01-16 18:08:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:03,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:03,900 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:08:03,900 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:08:03,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:08:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-01-16 18:08:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:08:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3124 transitions. [2020-01-16 18:08:03,922 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3124 transitions. Word has length 25 [2020-01-16 18:08:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:03,922 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3124 transitions. [2020-01-16 18:08:03,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3124 transitions. [2020-01-16 18:08:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:03,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:03,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:03,923 INFO L426 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1793744055, now seen corresponding path program 499 times [2020-01-16 18:08:03,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:03,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121449752] [2020-01-16 18:08:03,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:04,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-01-16 18:08:04,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121449752] [2020-01-16 18:08:04,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:04,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:04,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744242348] [2020-01-16 18:08:04,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:04,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:04,353 INFO L87 Difference]: Start difference. First operand 784 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:08:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:04,512 INFO L93 Difference]: Finished difference Result 1393 states and 4892 transitions. [2020-01-16 18:08:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:04,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:04,517 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:08:04,517 INFO L226 Difference]: Without dead ends: 1381 [2020-01-16 18:08:04,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-01-16 18:08:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 790. [2020-01-16 18:08:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-01-16 18:08:04,538 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-01-16 18:08:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:04,538 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-01-16 18:08:04,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-01-16 18:08:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:04,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:04,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:04,540 INFO L426 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash -890282283, now seen corresponding path program 500 times [2020-01-16 18:08:04,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:04,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262168396] [2020-01-16 18:08:04,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:04,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262168396] [2020-01-16 18:08:04,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:04,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:04,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308171110] [2020-01-16 18:08:04,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:04,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:04,963 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:08:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:05,104 INFO L93 Difference]: Finished difference Result 1397 states and 4897 transitions. [2020-01-16 18:08:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:05,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:05,107 INFO L225 Difference]: With dead ends: 1397 [2020-01-16 18:08:05,107 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:08:05,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:08:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 787. [2020-01-16 18:08:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:08:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3132 transitions. [2020-01-16 18:08:05,129 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3132 transitions. Word has length 25 [2020-01-16 18:08:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:05,130 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3132 transitions. [2020-01-16 18:08:05,130 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3132 transitions. [2020-01-16 18:08:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:05,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:05,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:05,131 INFO L426 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash 193306201, now seen corresponding path program 501 times [2020-01-16 18:08:05,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:05,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928320369] [2020-01-16 18:08:05,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:05,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928320369] [2020-01-16 18:08:05,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:05,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:05,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679586658] [2020-01-16 18:08:05,584 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:05,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:05,584 INFO L87 Difference]: Start difference. First operand 787 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:08:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:05,743 INFO L93 Difference]: Finished difference Result 1391 states and 4885 transitions. [2020-01-16 18:08:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:05,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:05,747 INFO L225 Difference]: With dead ends: 1391 [2020-01-16 18:08:05,747 INFO L226 Difference]: Without dead ends: 1379 [2020-01-16 18:08:05,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-01-16 18:08:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-01-16 18:08:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-01-16 18:08:05,769 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:05,769 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-01-16 18:08:05,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-01-16 18:08:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:05,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:05,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:05,770 INFO L426 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash -879779179, now seen corresponding path program 502 times [2020-01-16 18:08:05,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496970266] [2020-01-16 18:08:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:06,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496970266] [2020-01-16 18:08:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:06,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074316807] [2020-01-16 18:08:06,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:06,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:06,202 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:06,351 INFO L93 Difference]: Finished difference Result 1393 states and 4886 transitions. [2020-01-16 18:08:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:06,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:06,355 INFO L225 Difference]: With dead ends: 1393 [2020-01-16 18:08:06,355 INFO L226 Difference]: Without dead ends: 1376 [2020-01-16 18:08:06,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-01-16 18:08:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-01-16 18:08:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:08:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-01-16 18:08:06,377 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-01-16 18:08:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:06,377 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-01-16 18:08:06,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-01-16 18:08:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:06,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:06,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:06,379 INFO L426 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 203809305, now seen corresponding path program 503 times [2020-01-16 18:08:06,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:06,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877966910] [2020-01-16 18:08:06,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:06,725 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2020-01-16 18:08:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:06,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877966910] [2020-01-16 18:08:06,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:06,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:06,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308774203] [2020-01-16 18:08:06,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:06,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:06,839 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:08:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:06,980 INFO L93 Difference]: Finished difference Result 1401 states and 4904 transitions. [2020-01-16 18:08:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:06,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:06,984 INFO L225 Difference]: With dead ends: 1401 [2020-01-16 18:08:06,984 INFO L226 Difference]: Without dead ends: 1385 [2020-01-16 18:08:06,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-01-16 18:08:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-01-16 18:08:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3138 transitions. [2020-01-16 18:08:07,008 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3138 transitions. Word has length 25 [2020-01-16 18:08:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:07,008 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3138 transitions. [2020-01-16 18:08:07,008 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3138 transitions. [2020-01-16 18:08:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:07,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:07,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:07,010 INFO L426 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1814750263, now seen corresponding path program 504 times [2020-01-16 18:08:07,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:07,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309776830] [2020-01-16 18:08:07,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:07,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309776830] [2020-01-16 18:08:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:07,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:07,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722311469] [2020-01-16 18:08:07,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:07,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:07,454 INFO L87 Difference]: Start difference. First operand 792 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:08:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:07,597 INFO L93 Difference]: Finished difference Result 1399 states and 4895 transitions. [2020-01-16 18:08:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:07,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:07,601 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:08:07,601 INFO L226 Difference]: Without dead ends: 1374 [2020-01-16 18:08:07,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-01-16 18:08:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 781. [2020-01-16 18:08:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:08:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:08:07,623 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:08:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:07,623 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:08:07,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:08:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:07,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:07,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:07,624 INFO L426 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash -682963273, now seen corresponding path program 505 times [2020-01-16 18:08:07,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:07,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346962758] [2020-01-16 18:08:07,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:08,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346962758] [2020-01-16 18:08:08,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:08,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:08,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731234148] [2020-01-16 18:08:08,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:08,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:08,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:08,080 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:08:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:08,234 INFO L93 Difference]: Finished difference Result 1406 states and 4929 transitions. [2020-01-16 18:08:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:08,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:08,238 INFO L225 Difference]: With dead ends: 1406 [2020-01-16 18:08:08,238 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:08:08,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:08:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-01-16 18:08:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-01-16 18:08:08,263 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-01-16 18:08:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:08,263 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-01-16 18:08:08,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-01-16 18:08:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:08,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:08,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] [2020-01-16 18:08:08,264 INFO L426 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash 297791445, now seen corresponding path program 506 times [2020-01-16 18:08:08,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:08,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756317359] [2020-01-16 18:08:08,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:08,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756317359] [2020-01-16 18:08:08,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:08,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:08,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381416121] [2020-01-16 18:08:08,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:08,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:08,722 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:08:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:08,872 INFO L93 Difference]: Finished difference Result 1405 states and 4924 transitions. [2020-01-16 18:08:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:08,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:08,876 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:08:08,876 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:08:08,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:08:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:08:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-01-16 18:08:08,899 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:08,899 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-01-16 18:08:08,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-01-16 18:08:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:08,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:08,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:08,900 INFO L426 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1243070805, now seen corresponding path program 507 times [2020-01-16 18:08:08,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:08,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114380426] [2020-01-16 18:08:08,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:09,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-01-16 18:08:09,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114380426] [2020-01-16 18:08:09,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:09,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:09,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698268013] [2020-01-16 18:08:09,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:09,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:09,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:09,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:09,350 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:09,496 INFO L93 Difference]: Finished difference Result 1411 states and 4937 transitions. [2020-01-16 18:08:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:09,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:09,500 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:08:09,500 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:08:09,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:08:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:08:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-01-16 18:08:09,523 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-01-16 18:08:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:09,523 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-01-16 18:08:09,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-01-16 18:08:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:09,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:09,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:09,524 INFO L426 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2060638669, now seen corresponding path program 508 times [2020-01-16 18:08:09,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:09,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453051937] [2020-01-16 18:08:09,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:09,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-01-16 18:08:09,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453051937] [2020-01-16 18:08:09,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:09,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:09,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684024595] [2020-01-16 18:08:09,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:09,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:09,991 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:08:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:10,141 INFO L93 Difference]: Finished difference Result 1414 states and 4939 transitions. [2020-01-16 18:08:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:10,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:10,145 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:08:10,145 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:08:10,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:08:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:08:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-01-16 18:08:10,167 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-01-16 18:08:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:10,167 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-01-16 18:08:10,167 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-01-16 18:08:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:10,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:10,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:10,168 INFO L426 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:10,169 INFO L82 PathProgramCache]: Analyzing trace with hash 962012855, now seen corresponding path program 509 times [2020-01-16 18:08:10,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:10,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842930944] [2020-01-16 18:08:10,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:10,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842930944] [2020-01-16 18:08:10,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:10,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:10,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439539410] [2020-01-16 18:08:10,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:10,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:10,622 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:08:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:10,765 INFO L93 Difference]: Finished difference Result 1408 states and 4927 transitions. [2020-01-16 18:08:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:10,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:10,769 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:08:10,769 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:08:10,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:08:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-01-16 18:08:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:08:10,791 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:08:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:10,791 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:08:10,791 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:08:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:10,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:10,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:10,793 INFO L426 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1722013483, now seen corresponding path program 510 times [2020-01-16 18:08:10,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:10,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322935566] [2020-01-16 18:08:10,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:11,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322935566] [2020-01-16 18:08:11,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:11,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:11,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562322256] [2020-01-16 18:08:11,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:11,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:11,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:11,242 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:08:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:11,400 INFO L93 Difference]: Finished difference Result 1412 states and 4932 transitions. [2020-01-16 18:08:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:11,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:11,403 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:08:11,403 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:08:11,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:08:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-01-16 18:08:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:08:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3134 transitions. [2020-01-16 18:08:11,425 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3134 transitions. Word has length 25 [2020-01-16 18:08:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:11,425 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3134 transitions. [2020-01-16 18:08:11,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3134 transitions. [2020-01-16 18:08:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:11,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:11,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] [2020-01-16 18:08:11,427 INFO L426 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1527934725, now seen corresponding path program 511 times [2020-01-16 18:08:11,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:11,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385700383] [2020-01-16 18:08:11,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:11,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385700383] [2020-01-16 18:08:11,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:11,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:11,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535843912] [2020-01-16 18:08:11,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:11,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:11,885 INFO L87 Difference]: Start difference. First operand 786 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:08:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:12,034 INFO L93 Difference]: Finished difference Result 1411 states and 4936 transitions. [2020-01-16 18:08:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:12,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:12,038 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:08:12,038 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:08:12,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:08:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:08:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3153 transitions. [2020-01-16 18:08:12,060 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3153 transitions. Word has length 25 [2020-01-16 18:08:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:12,060 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3153 transitions. [2020-01-16 18:08:12,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3153 transitions. [2020-01-16 18:08:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:12,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:12,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:12,061 INFO L426 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -547180007, now seen corresponding path program 512 times [2020-01-16 18:08:12,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:12,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476990961] [2020-01-16 18:08:12,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:12,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476990961] [2020-01-16 18:08:12,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:12,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:12,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306063988] [2020-01-16 18:08:12,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:12,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:12,532 INFO L87 Difference]: Start difference. First operand 793 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:08:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:12,685 INFO L93 Difference]: Finished difference Result 1410 states and 4931 transitions. [2020-01-16 18:08:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:12,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:12,690 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:08:12,690 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:08:12,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:08:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-01-16 18:08:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3145 transitions. [2020-01-16 18:08:12,715 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:12,715 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3145 transitions. [2020-01-16 18:08:12,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3145 transitions. [2020-01-16 18:08:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:12,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:12,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:12,717 INFO L426 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash -44799787, now seen corresponding path program 513 times [2020-01-16 18:08:12,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:12,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740302831] [2020-01-16 18:08:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:13,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740302831] [2020-01-16 18:08:13,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:13,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:13,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155597050] [2020-01-16 18:08:13,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:13,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:13,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:13,183 INFO L87 Difference]: Start difference. First operand 790 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:13,344 INFO L93 Difference]: Finished difference Result 1419 states and 4949 transitions. [2020-01-16 18:08:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:13,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:13,348 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:08:13,348 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:08:13,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:08:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 795. [2020-01-16 18:08:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-01-16 18:08:13,371 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-01-16 18:08:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:13,371 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-01-16 18:08:13,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-01-16 18:08:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:13,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:13,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:13,373 INFO L426 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash 967464243, now seen corresponding path program 514 times [2020-01-16 18:08:13,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:13,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529834196] [2020-01-16 18:08:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:13,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529834196] [2020-01-16 18:08:13,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:13,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:13,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173846214] [2020-01-16 18:08:13,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:13,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:13,825 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:08:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:13,942 INFO L93 Difference]: Finished difference Result 1424 states and 4954 transitions. [2020-01-16 18:08:13,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:13,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:13,946 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:08:13,946 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:08:13,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:08:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 790. [2020-01-16 18:08:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-01-16 18:08:13,968 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-01-16 18:08:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:13,968 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-01-16 18:08:13,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-01-16 18:08:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:13,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:13,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:13,969 INFO L426 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 768233851, now seen corresponding path program 515 times [2020-01-16 18:08:13,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:13,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270981666] [2020-01-16 18:08:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:14,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-01-16 18:08:14,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270981666] [2020-01-16 18:08:14,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:14,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:14,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372097066] [2020-01-16 18:08:14,417 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:14,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:14,417 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:08:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:14,567 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-01-16 18:08:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:14,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:14,571 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:08:14,571 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:08:14,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:08:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 794. [2020-01-16 18:08:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3148 transitions. [2020-01-16 18:08:14,593 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3148 transitions. Word has length 25 [2020-01-16 18:08:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:14,594 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3148 transitions. [2020-01-16 18:08:14,594 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3148 transitions. [2020-01-16 18:08:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:14,595 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:14,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:14,595 INFO L426 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1306089429, now seen corresponding path program 516 times [2020-01-16 18:08:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:14,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967230837] [2020-01-16 18:08:14,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:15,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-01-16 18:08:15,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967230837] [2020-01-16 18:08:15,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:15,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:15,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421341034] [2020-01-16 18:08:15,061 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:15,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:15,061 INFO L87 Difference]: Start difference. First operand 794 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:08:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:15,181 INFO L93 Difference]: Finished difference Result 1422 states and 4946 transitions. [2020-01-16 18:08:15,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:15,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:15,185 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:08:15,186 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:08:15,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:08:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-01-16 18:08:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:08:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-01-16 18:08:15,209 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-01-16 18:08:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:15,209 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-01-16 18:08:15,209 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-01-16 18:08:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:15,210 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:15,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:15,211 INFO L426 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -24386373, now seen corresponding path program 517 times [2020-01-16 18:08:15,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:15,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998169155] [2020-01-16 18:08:15,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:15,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-01-16 18:08:15,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998169155] [2020-01-16 18:08:15,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:15,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:15,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136173948] [2020-01-16 18:08:15,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:15,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:15,674 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:08:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:15,820 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-01-16 18:08:15,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:15,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:15,824 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:08:15,824 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:08:15,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:08:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 796. [2020-01-16 18:08:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:08:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3157 transitions. [2020-01-16 18:08:15,847 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3157 transitions. Word has length 25 [2020-01-16 18:08:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:15,847 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3157 transitions. [2020-01-16 18:08:15,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3157 transitions. [2020-01-16 18:08:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:15,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:15,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:15,849 INFO L426 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:15,849 INFO L82 PathProgramCache]: Analyzing trace with hash 966871449, now seen corresponding path program 518 times [2020-01-16 18:08:15,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:15,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061629318] [2020-01-16 18:08:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:16,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061629318] [2020-01-16 18:08:16,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:16,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:16,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587137090] [2020-01-16 18:08:16,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:16,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:16,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:16,319 INFO L87 Difference]: Start difference. First operand 796 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:08:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:16,463 INFO L93 Difference]: Finished difference Result 1431 states and 4975 transitions. [2020-01-16 18:08:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:16,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:16,467 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:08:16,467 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:08:16,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:08:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 792. [2020-01-16 18:08:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-01-16 18:08:16,489 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-01-16 18:08:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:16,489 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-01-16 18:08:16,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-01-16 18:08:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:16,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:16,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:16,490 INFO L426 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -467285513, now seen corresponding path program 519 times [2020-01-16 18:08:16,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:16,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499179795] [2020-01-16 18:08:16,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:16,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499179795] [2020-01-16 18:08:16,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:16,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:16,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931596303] [2020-01-16 18:08:16,948 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:16,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:16,948 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:08:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:17,098 INFO L93 Difference]: Finished difference Result 1431 states and 4974 transitions. [2020-01-16 18:08:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:17,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:17,102 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:08:17,102 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:08:17,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:08:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 797. [2020-01-16 18:08:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:08:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3155 transitions. [2020-01-16 18:08:17,124 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3155 transitions. Word has length 25 [2020-01-16 18:08:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:17,125 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3155 transitions. [2020-01-16 18:08:17,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3155 transitions. [2020-01-16 18:08:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:17,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:17,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] [2020-01-16 18:08:17,126 INFO L426 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 544978517, now seen corresponding path program 520 times [2020-01-16 18:08:17,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:17,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274537693] [2020-01-16 18:08:17,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:17,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274537693] [2020-01-16 18:08:17,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:17,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:17,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045654595] [2020-01-16 18:08:17,595 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:17,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:17,595 INFO L87 Difference]: Start difference. First operand 797 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:08:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:17,728 INFO L93 Difference]: Finished difference Result 1436 states and 4979 transitions. [2020-01-16 18:08:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:17,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:17,732 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:08:17,733 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:08:17,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:08:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 792. [2020-01-16 18:08:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-01-16 18:08:17,755 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-01-16 18:08:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:17,755 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-01-16 18:08:17,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-01-16 18:08:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:17,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:17,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:17,756 INFO L426 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2012681989, now seen corresponding path program 521 times [2020-01-16 18:08:17,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:17,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975097040] [2020-01-16 18:08:17,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:18,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975097040] [2020-01-16 18:08:18,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:18,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:18,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024324065] [2020-01-16 18:08:18,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:18,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:18,223 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:08:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:18,375 INFO L93 Difference]: Finished difference Result 1441 states and 4991 transitions. [2020-01-16 18:08:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:18,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:18,379 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:08:18,379 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:08:18,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:08:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 801. [2020-01-16 18:08:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:08:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3157 transitions. [2020-01-16 18:08:18,402 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3157 transitions. Word has length 25 [2020-01-16 18:08:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:18,402 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3157 transitions. [2020-01-16 18:08:18,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3157 transitions. [2020-01-16 18:08:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:18,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:18,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:18,403 INFO L426 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199927, now seen corresponding path program 522 times [2020-01-16 18:08:18,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:18,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004614887] [2020-01-16 18:08:18,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:18,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004614887] [2020-01-16 18:08:18,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:18,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:18,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976642653] [2020-01-16 18:08:18,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:18,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:18,898 INFO L87 Difference]: Start difference. First operand 801 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:08:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:19,026 INFO L93 Difference]: Finished difference Result 1443 states and 4987 transitions. [2020-01-16 18:08:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:19,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:19,030 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:08:19,031 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:08:19,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:08:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 786. [2020-01-16 18:08:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:08:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3125 transitions. [2020-01-16 18:08:19,053 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3125 transitions. Word has length 25 [2020-01-16 18:08:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:19,053 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3125 transitions. [2020-01-16 18:08:19,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3125 transitions. [2020-01-16 18:08:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:19,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:19,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] [2020-01-16 18:08:19,055 INFO L426 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1209830507, now seen corresponding path program 523 times [2020-01-16 18:08:19,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:19,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865442815] [2020-01-16 18:08:19,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:19,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-01-16 18:08:19,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865442815] [2020-01-16 18:08:19,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:19,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:19,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58790683] [2020-01-16 18:08:19,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:19,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:19,521 INFO L87 Difference]: Start difference. First operand 786 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:08:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:19,672 INFO L93 Difference]: Finished difference Result 1421 states and 4949 transitions. [2020-01-16 18:08:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:19,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:19,676 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:08:19,676 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:08:19,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:08:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-01-16 18:08:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:08:19,698 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:08:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:19,699 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:08:19,699 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:08:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:19,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:19,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:19,700 INFO L426 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash 401110451, now seen corresponding path program 524 times [2020-01-16 18:08:19,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:19,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007953843] [2020-01-16 18:08:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:20,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-01-16 18:08:20,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007953843] [2020-01-16 18:08:20,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:20,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:20,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296274695] [2020-01-16 18:08:20,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:20,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:20,100 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:08:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:20,245 INFO L93 Difference]: Finished difference Result 1425 states and 4954 transitions. [2020-01-16 18:08:20,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:20,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:20,249 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:08:20,249 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:08:20,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:08:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 791. [2020-01-16 18:08:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-01-16 18:08:20,282 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-01-16 18:08:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:20,282 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-01-16 18:08:20,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-01-16 18:08:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:20,284 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:20,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] [2020-01-16 18:08:20,284 INFO L426 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -115738919, now seen corresponding path program 525 times [2020-01-16 18:08:20,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:20,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114477398] [2020-01-16 18:08:20,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:20,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114477398] [2020-01-16 18:08:20,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:20,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:20,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155632254] [2020-01-16 18:08:20,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:20,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:20,752 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:08:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:20,901 INFO L93 Difference]: Finished difference Result 1424 states and 4951 transitions. [2020-01-16 18:08:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:20,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:20,905 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:08:20,905 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:08:20,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:08:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-01-16 18:08:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:08:20,927 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:20,927 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:08:20,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:08:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:20,928 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:20,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:20,928 INFO L426 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 422116659, now seen corresponding path program 526 times [2020-01-16 18:08:20,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:20,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393177385] [2020-01-16 18:08:20,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:21,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393177385] [2020-01-16 18:08:21,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:21,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:21,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19974349] [2020-01-16 18:08:21,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:21,387 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:21,510 INFO L93 Difference]: Finished difference Result 1430 states and 4959 transitions. [2020-01-16 18:08:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:21,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:21,514 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:08:21,514 INFO L226 Difference]: Without dead ends: 1408 [2020-01-16 18:08:21,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-01-16 18:08:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-01-16 18:08:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-01-16 18:08:21,536 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-01-16 18:08:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:21,536 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-01-16 18:08:21,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-01-16 18:08:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:21,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:21,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:21,537 INFO L426 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash -105235815, now seen corresponding path program 527 times [2020-01-16 18:08:21,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:21,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987604329] [2020-01-16 18:08:21,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:22,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987604329] [2020-01-16 18:08:22,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:22,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:22,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493685053] [2020-01-16 18:08:22,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:22,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:22,005 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:08:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:22,155 INFO L93 Difference]: Finished difference Result 1437 states and 4976 transitions. [2020-01-16 18:08:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:22,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:22,159 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:08:22,160 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:08:22,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:08:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 800. [2020-01-16 18:08:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:08:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3150 transitions. [2020-01-16 18:08:22,196 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3150 transitions. Word has length 25 [2020-01-16 18:08:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:22,196 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3150 transitions. [2020-01-16 18:08:22,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3150 transitions. [2020-01-16 18:08:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:22,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:22,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:22,197 INFO L426 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1178321195, now seen corresponding path program 528 times [2020-01-16 18:08:22,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:22,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953235102] [2020-01-16 18:08:22,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:22,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953235102] [2020-01-16 18:08:22,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:22,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:22,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465780899] [2020-01-16 18:08:22,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:22,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:22,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:22,678 INFO L87 Difference]: Start difference. First operand 800 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:08:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:22,838 INFO L93 Difference]: Finished difference Result 1439 states and 4972 transitions. [2020-01-16 18:08:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:22,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:22,842 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:08:22,842 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:08:22,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:08:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 781. [2020-01-16 18:08:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:08:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3111 transitions. [2020-01-16 18:08:22,865 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3111 transitions. Word has length 25 [2020-01-16 18:08:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:22,865 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3111 transitions. [2020-01-16 18:08:22,865 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3111 transitions. [2020-01-16 18:08:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:22,866 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:22,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:22,866 INFO L426 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1317604617, now seen corresponding path program 529 times [2020-01-16 18:08:22,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:22,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048584468] [2020-01-16 18:08:22,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:23,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-01-16 18:08:23,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048584468] [2020-01-16 18:08:23,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:23,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:23,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040047423] [2020-01-16 18:08:23,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:23,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:23,333 INFO L87 Difference]: Start difference. First operand 781 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:08:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:23,484 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-01-16 18:08:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:23,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:23,488 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:08:23,488 INFO L226 Difference]: Without dead ends: 1383 [2020-01-16 18:08:23,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-01-16 18:08:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-01-16 18:08:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-01-16 18:08:23,511 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:23,511 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-01-16 18:08:23,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-01-16 18:08:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:23,512 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:23,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:23,512 INFO L426 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:23,512 INFO L82 PathProgramCache]: Analyzing trace with hash -336849899, now seen corresponding path program 530 times [2020-01-16 18:08:23,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:23,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061671281] [2020-01-16 18:08:23,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:23,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061671281] [2020-01-16 18:08:23,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:23,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:23,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215671432] [2020-01-16 18:08:23,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:23,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:23,976 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:24,139 INFO L93 Difference]: Finished difference Result 1395 states and 4897 transitions. [2020-01-16 18:08:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:24,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:24,143 INFO L225 Difference]: With dead ends: 1395 [2020-01-16 18:08:24,143 INFO L226 Difference]: Without dead ends: 1380 [2020-01-16 18:08:24,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-01-16 18:08:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-01-16 18:08:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:08:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-01-16 18:08:24,164 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:24,165 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-01-16 18:08:24,165 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-01-16 18:08:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:24,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:24,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:24,166 INFO L426 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1760503757, now seen corresponding path program 531 times [2020-01-16 18:08:24,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:24,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575547105] [2020-01-16 18:08:24,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:24,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-01-16 18:08:24,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575547105] [2020-01-16 18:08:24,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:24,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935972181] [2020-01-16 18:08:24,625 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:24,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:24,625 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:24,779 INFO L93 Difference]: Finished difference Result 1399 states and 4906 transitions. [2020-01-16 18:08:24,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:24,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:24,783 INFO L225 Difference]: With dead ends: 1399 [2020-01-16 18:08:24,783 INFO L226 Difference]: Without dead ends: 1386 [2020-01-16 18:08:24,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-01-16 18:08:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-01-16 18:08:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-01-16 18:08:24,805 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-01-16 18:08:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:24,805 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-01-16 18:08:24,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-01-16 18:08:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:24,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:24,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:24,807 INFO L426 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash -758742831, now seen corresponding path program 532 times [2020-01-16 18:08:24,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:24,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534379939] [2020-01-16 18:08:24,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:25,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534379939] [2020-01-16 18:08:25,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:25,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:25,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737275904] [2020-01-16 18:08:25,281 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:25,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:25,282 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:08:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:25,440 INFO L93 Difference]: Finished difference Result 1400 states and 4904 transitions. [2020-01-16 18:08:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:25,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:25,445 INFO L225 Difference]: With dead ends: 1400 [2020-01-16 18:08:25,445 INFO L226 Difference]: Without dead ends: 1382 [2020-01-16 18:08:25,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-01-16 18:08:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-01-16 18:08:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:08:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-01-16 18:08:25,467 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-01-16 18:08:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:25,467 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-01-16 18:08:25,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-01-16 18:08:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:25,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:25,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:25,468 INFO L426 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 652967735, now seen corresponding path program 533 times [2020-01-16 18:08:25,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:25,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937962655] [2020-01-16 18:08:25,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:25,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-01-16 18:08:25,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937962655] [2020-01-16 18:08:25,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:25,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:25,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715266167] [2020-01-16 18:08:25,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:25,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:25,927 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:08:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:26,078 INFO L93 Difference]: Finished difference Result 1396 states and 4896 transitions. [2020-01-16 18:08:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:26,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:26,082 INFO L225 Difference]: With dead ends: 1396 [2020-01-16 18:08:26,082 INFO L226 Difference]: Without dead ends: 1384 [2020-01-16 18:08:26,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-01-16 18:08:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 791. [2020-01-16 18:08:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-01-16 18:08:26,103 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-01-16 18:08:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:26,104 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-01-16 18:08:26,104 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-01-16 18:08:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:26,105 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:26,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:26,105 INFO L426 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:26,105 INFO L82 PathProgramCache]: Analyzing trace with hash -420117645, now seen corresponding path program 534 times [2020-01-16 18:08:26,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:26,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981760949] [2020-01-16 18:08:26,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:26,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981760949] [2020-01-16 18:08:26,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:26,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:26,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663631937] [2020-01-16 18:08:26,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:26,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:26,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:26,559 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:08:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:26,712 INFO L93 Difference]: Finished difference Result 1398 states and 4897 transitions. [2020-01-16 18:08:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:26,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:26,717 INFO L225 Difference]: With dead ends: 1398 [2020-01-16 18:08:26,717 INFO L226 Difference]: Without dead ends: 1378 [2020-01-16 18:08:26,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-01-16 18:08:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 785. [2020-01-16 18:08:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:08:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3126 transitions. [2020-01-16 18:08:26,739 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3126 transitions. Word has length 25 [2020-01-16 18:08:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:26,740 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3126 transitions. [2020-01-16 18:08:26,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3126 transitions. [2020-01-16 18:08:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:26,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:26,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:26,741 INFO L426 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1740090343, now seen corresponding path program 535 times [2020-01-16 18:08:26,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:26,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22601946] [2020-01-16 18:08:26,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:27,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22601946] [2020-01-16 18:08:27,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:27,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:27,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547521882] [2020-01-16 18:08:27,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:27,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:27,203 INFO L87 Difference]: Start difference. First operand 785 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:08:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:27,351 INFO L93 Difference]: Finished difference Result 1403 states and 4913 transitions. [2020-01-16 18:08:27,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:27,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:27,355 INFO L225 Difference]: With dead ends: 1403 [2020-01-16 18:08:27,355 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:08:27,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:08:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 792. [2020-01-16 18:08:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-01-16 18:08:27,378 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:27,378 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-01-16 18:08:27,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-01-16 18:08:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:27,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:27,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:27,380 INFO L426 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -759335625, now seen corresponding path program 536 times [2020-01-16 18:08:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:27,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327035964] [2020-01-16 18:08:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:27,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327035964] [2020-01-16 18:08:27,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:27,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:27,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51075227] [2020-01-16 18:08:27,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:27,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:27,901 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:28,069 INFO L93 Difference]: Finished difference Result 1402 states and 4908 transitions. [2020-01-16 18:08:28,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:28,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:28,073 INFO L225 Difference]: With dead ends: 1402 [2020-01-16 18:08:28,073 INFO L226 Difference]: Without dead ends: 1387 [2020-01-16 18:08:28,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-01-16 18:08:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 789. [2020-01-16 18:08:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3137 transitions. [2020-01-16 18:08:28,096 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:28,096 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3137 transitions. [2020-01-16 18:08:28,096 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3137 transitions. [2020-01-16 18:08:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:28,097 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:28,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:28,098 INFO L426 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash -256955405, now seen corresponding path program 537 times [2020-01-16 18:08:28,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:28,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855299986] [2020-01-16 18:08:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:28,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855299986] [2020-01-16 18:08:28,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:28,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:28,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481704083] [2020-01-16 18:08:28,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:28,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:28,546 INFO L87 Difference]: Start difference. First operand 789 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:28,716 INFO L93 Difference]: Finished difference Result 1411 states and 4926 transitions. [2020-01-16 18:08:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:28,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:28,720 INFO L225 Difference]: With dead ends: 1411 [2020-01-16 18:08:28,720 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:08:28,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:08:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-01-16 18:08:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-01-16 18:08:28,743 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-01-16 18:08:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:28,743 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-01-16 18:08:28,743 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-01-16 18:08:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:28,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:28,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:28,744 INFO L426 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 755308625, now seen corresponding path program 538 times [2020-01-16 18:08:28,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:28,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191417755] [2020-01-16 18:08:28,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:29,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191417755] [2020-01-16 18:08:29,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:29,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:29,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599728776] [2020-01-16 18:08:29,196 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:29,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:29,197 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:08:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:29,322 INFO L93 Difference]: Finished difference Result 1416 states and 4931 transitions. [2020-01-16 18:08:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:29,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:29,326 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:08:29,326 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:08:29,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:08:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-01-16 18:08:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3133 transitions. [2020-01-16 18:08:29,349 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3133 transitions. Word has length 25 [2020-01-16 18:08:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:29,349 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3133 transitions. [2020-01-16 18:08:29,349 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3133 transitions. [2020-01-16 18:08:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:29,350 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:29,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:29,350 INFO L426 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash 556078233, now seen corresponding path program 539 times [2020-01-16 18:08:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:29,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980035686] [2020-01-16 18:08:29,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:29,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-01-16 18:08:29,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980035686] [2020-01-16 18:08:29,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:29,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:29,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585662239] [2020-01-16 18:08:29,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:29,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:29,802 INFO L87 Difference]: Start difference. First operand 789 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:08:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:29,964 INFO L93 Difference]: Finished difference Result 1408 states and 4915 transitions. [2020-01-16 18:08:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:29,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:29,968 INFO L225 Difference]: With dead ends: 1408 [2020-01-16 18:08:29,968 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:08:29,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:08:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 793. [2020-01-16 18:08:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-01-16 18:08:29,990 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-01-16 18:08:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:29,990 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-01-16 18:08:29,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-01-16 18:08:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:29,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:29,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] [2020-01-16 18:08:29,992 INFO L426 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1093933811, now seen corresponding path program 540 times [2020-01-16 18:08:29,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:29,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326488581] [2020-01-16 18:08:29,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:30,451 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:08:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:30,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326488581] [2020-01-16 18:08:30,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:30,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:30,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573085304] [2020-01-16 18:08:30,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:30,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:30,457 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:08:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:30,602 INFO L93 Difference]: Finished difference Result 1414 states and 4923 transitions. [2020-01-16 18:08:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:30,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:30,606 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:08:30,606 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:08:30,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:08:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 785. [2020-01-16 18:08:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:08:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3122 transitions. [2020-01-16 18:08:30,629 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3122 transitions. Word has length 25 [2020-01-16 18:08:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:30,629 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3122 transitions. [2020-01-16 18:08:30,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3122 transitions. [2020-01-16 18:08:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:30,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:30,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] [2020-01-16 18:08:30,630 INFO L426 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1267006361, now seen corresponding path program 541 times [2020-01-16 18:08:30,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:30,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341407426] [2020-01-16 18:08:30,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:31,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341407426] [2020-01-16 18:08:31,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:31,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:31,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046441442] [2020-01-16 18:08:31,094 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:31,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:31,094 INFO L87 Difference]: Start difference. First operand 785 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:08:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:31,249 INFO L93 Difference]: Finished difference Result 1412 states and 4933 transitions. [2020-01-16 18:08:31,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:31,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:31,253 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:08:31,253 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:08:31,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:08:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-01-16 18:08:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-01-16 18:08:31,276 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-01-16 18:08:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:31,276 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-01-16 18:08:31,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-01-16 18:08:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:31,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:31,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] [2020-01-16 18:08:31,277 INFO L426 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2026200009, now seen corresponding path program 542 times [2020-01-16 18:08:31,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:31,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161049021] [2020-01-16 18:08:31,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:31,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161049021] [2020-01-16 18:08:31,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:31,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:31,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157014517] [2020-01-16 18:08:31,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:31,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:31,740 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:08:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:31,897 INFO L93 Difference]: Finished difference Result 1413 states and 4931 transitions. [2020-01-16 18:08:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:31,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:31,901 INFO L225 Difference]: With dead ends: 1413 [2020-01-16 18:08:31,901 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:08:31,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:08:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-01-16 18:08:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-01-16 18:08:31,923 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-01-16 18:08:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:31,923 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-01-16 18:08:31,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-01-16 18:08:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:31,925 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:31,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:31,925 INFO L426 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1101926857, now seen corresponding path program 543 times [2020-01-16 18:08:31,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:31,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617183184] [2020-01-16 18:08:31,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:32,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-01-16 18:08:32,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617183184] [2020-01-16 18:08:32,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:32,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:32,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641100028] [2020-01-16 18:08:32,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:32,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:32,376 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:08:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:32,527 INFO L93 Difference]: Finished difference Result 1417 states and 4938 transitions. [2020-01-16 18:08:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:32,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:32,531 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:08:32,532 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:08:32,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:08:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-01-16 18:08:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:08:32,554 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:32,554 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:08:32,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:08:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:32,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:32,555 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:32,555 INFO L426 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -89662827, now seen corresponding path program 544 times [2020-01-16 18:08:32,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:32,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016871615] [2020-01-16 18:08:32,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:32,930 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-01-16 18:08:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:33,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016871615] [2020-01-16 18:08:33,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:33,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:33,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435178767] [2020-01-16 18:08:33,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:33,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:33,039 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:33,195 INFO L93 Difference]: Finished difference Result 1422 states and 4943 transitions. [2020-01-16 18:08:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:33,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:33,199 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:08:33,199 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:08:33,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:08:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-01-16 18:08:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:08:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3131 transitions. [2020-01-16 18:08:33,221 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3131 transitions. Word has length 25 [2020-01-16 18:08:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:33,221 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3131 transitions. [2020-01-16 18:08:33,221 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3131 transitions. [2020-01-16 18:08:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:33,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:33,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:33,222 INFO L426 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash -710786151, now seen corresponding path program 545 times [2020-01-16 18:08:33,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:33,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070966827] [2020-01-16 18:08:33,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:33,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070966827] [2020-01-16 18:08:33,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:33,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:33,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755298034] [2020-01-16 18:08:33,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:33,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:33,682 INFO L87 Difference]: Start difference. First operand 790 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:08:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:33,830 INFO L93 Difference]: Finished difference Result 1420 states and 4940 transitions. [2020-01-16 18:08:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:33,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:33,833 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:08:33,834 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:08:33,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:08:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 796. [2020-01-16 18:08:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:08:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3142 transitions. [2020-01-16 18:08:33,857 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3142 transitions. Word has length 25 [2020-01-16 18:08:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:33,857 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3142 transitions. [2020-01-16 18:08:33,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3142 transitions. [2020-01-16 18:08:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:33,858 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:33,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:33,858 INFO L426 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash 900154807, now seen corresponding path program 546 times [2020-01-16 18:08:33,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:33,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647681555] [2020-01-16 18:08:33,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:34,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647681555] [2020-01-16 18:08:34,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:34,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:34,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233622835] [2020-01-16 18:08:34,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:34,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:34,317 INFO L87 Difference]: Start difference. First operand 796 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:08:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:34,439 INFO L93 Difference]: Finished difference Result 1424 states and 4942 transitions. [2020-01-16 18:08:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:34,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:34,443 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:08:34,443 INFO L226 Difference]: Without dead ends: 1395 [2020-01-16 18:08:34,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-01-16 18:08:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2020-01-16 18:08:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:08:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3118 transitions. [2020-01-16 18:08:34,465 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3118 transitions. Word has length 25 [2020-01-16 18:08:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:34,465 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3118 transitions. [2020-01-16 18:08:34,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3118 transitions. [2020-01-16 18:08:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:34,466 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:34,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:34,466 INFO L426 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1518875627, now seen corresponding path program 547 times [2020-01-16 18:08:34,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:34,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535171533] [2020-01-16 18:08:34,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:34,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535171533] [2020-01-16 18:08:34,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:34,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:34,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939620758] [2020-01-16 18:08:34,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:34,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:34,923 INFO L87 Difference]: Start difference. First operand 785 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:08:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:35,075 INFO L93 Difference]: Finished difference Result 1405 states and 4910 transitions. [2020-01-16 18:08:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:35,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:35,078 INFO L225 Difference]: With dead ends: 1405 [2020-01-16 18:08:35,078 INFO L226 Difference]: Without dead ends: 1393 [2020-01-16 18:08:35,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-01-16 18:08:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-01-16 18:08:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:08:35,101 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:35,101 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:08:35,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:08:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:35,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:35,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:35,102 INFO L426 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1703006289, now seen corresponding path program 548 times [2020-01-16 18:08:35,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:35,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226607562] [2020-01-16 18:08:35,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:35,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-01-16 18:08:35,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226607562] [2020-01-16 18:08:35,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:35,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:35,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636654793] [2020-01-16 18:08:35,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:35,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:35,568 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:35,719 INFO L93 Difference]: Finished difference Result 1407 states and 4911 transitions. [2020-01-16 18:08:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:35,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:35,724 INFO L225 Difference]: With dead ends: 1407 [2020-01-16 18:08:35,724 INFO L226 Difference]: Without dead ends: 1390 [2020-01-16 18:08:35,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-01-16 18:08:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-01-16 18:08:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-01-16 18:08:35,746 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-01-16 18:08:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:35,746 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-01-16 18:08:35,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-01-16 18:08:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:35,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:35,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:35,747 INFO L426 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1175653815, now seen corresponding path program 549 times [2020-01-16 18:08:35,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:35,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324786378] [2020-01-16 18:08:35,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:36,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-01-16 18:08:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324786378] [2020-01-16 18:08:36,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:36,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:36,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198508349] [2020-01-16 18:08:36,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:36,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:36,194 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:08:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:36,347 INFO L93 Difference]: Finished difference Result 1410 states and 4916 transitions. [2020-01-16 18:08:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:36,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:36,352 INFO L225 Difference]: With dead ends: 1410 [2020-01-16 18:08:36,352 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:08:36,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:08:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-01-16 18:08:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3136 transitions. [2020-01-16 18:08:36,375 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3136 transitions. Word has length 25 [2020-01-16 18:08:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:36,375 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3136 transitions. [2020-01-16 18:08:36,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3136 transitions. [2020-01-16 18:08:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:36,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:36,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:36,376 INFO L426 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1713509393, now seen corresponding path program 550 times [2020-01-16 18:08:36,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:36,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161504676] [2020-01-16 18:08:36,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:36,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161504676] [2020-01-16 18:08:36,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:36,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:36,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710647278] [2020-01-16 18:08:36,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:36,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:36,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:36,832 INFO L87 Difference]: Start difference. First operand 793 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:08:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:36,965 INFO L93 Difference]: Finished difference Result 1416 states and 4924 transitions. [2020-01-16 18:08:36,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:36,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:36,968 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:08:36,969 INFO L226 Difference]: Without dead ends: 1394 [2020-01-16 18:08:36,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-01-16 18:08:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-01-16 18:08:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3125 transitions. [2020-01-16 18:08:36,990 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3125 transitions. Word has length 25 [2020-01-16 18:08:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:36,990 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3125 transitions. [2020-01-16 18:08:36,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3125 transitions. [2020-01-16 18:08:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:36,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:36,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] [2020-01-16 18:08:36,991 INFO L426 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1196660023, now seen corresponding path program 551 times [2020-01-16 18:08:36,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:36,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182695290] [2020-01-16 18:08:36,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:37,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182695290] [2020-01-16 18:08:37,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:37,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:37,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890374089] [2020-01-16 18:08:37,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:37,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:37,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:37,455 INFO L87 Difference]: Start difference. First operand 789 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:08:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:37,643 INFO L93 Difference]: Finished difference Result 1416 states and 4926 transitions. [2020-01-16 18:08:37,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:37,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:37,647 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:08:37,647 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:08:37,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:08:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-01-16 18:08:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3136 transitions. [2020-01-16 18:08:37,682 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3136 transitions. Word has length 25 [2020-01-16 18:08:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:37,682 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3136 transitions. [2020-01-16 18:08:37,682 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3136 transitions. [2020-01-16 18:08:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:37,683 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:37,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] [2020-01-16 18:08:37,684 INFO L426 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1487366315, now seen corresponding path program 552 times [2020-01-16 18:08:37,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:37,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845571378] [2020-01-16 18:08:37,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:38,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-01-16 18:08:38,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845571378] [2020-01-16 18:08:38,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:38,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:38,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625863360] [2020-01-16 18:08:38,151 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:38,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:38,152 INFO L87 Difference]: Start difference. First operand 795 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:08:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:38,274 INFO L93 Difference]: Finished difference Result 1420 states and 4928 transitions. [2020-01-16 18:08:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:38,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:38,278 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:08:38,278 INFO L226 Difference]: Without dead ends: 1388 [2020-01-16 18:08:38,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-01-16 18:08:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 781. [2020-01-16 18:08:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:08:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:08:38,300 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:08:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:38,300 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:08:38,300 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:08:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:38,301 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:38,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:38,301 INFO L426 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash -26211883, now seen corresponding path program 553 times [2020-01-16 18:08:38,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:38,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107509264] [2020-01-16 18:08:38,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:38,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107509264] [2020-01-16 18:08:38,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:38,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:38,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270880160] [2020-01-16 18:08:38,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:38,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:38,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:38,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:38,752 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:08:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:38,910 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-01-16 18:08:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:38,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:38,914 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:08:38,914 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:08:38,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:08:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:08:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:08:38,936 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:08:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:38,937 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:08:38,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:08:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:38,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:38,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] [2020-01-16 18:08:38,938 INFO L426 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:38,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash 965045939, now seen corresponding path program 554 times [2020-01-16 18:08:38,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:38,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526395410] [2020-01-16 18:08:38,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:39,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526395410] [2020-01-16 18:08:39,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:39,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:39,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058751696] [2020-01-16 18:08:39,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:39,388 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:08:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:39,543 INFO L93 Difference]: Finished difference Result 1432 states and 4990 transitions. [2020-01-16 18:08:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:39,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:39,547 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:08:39,547 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:08:39,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:08:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-01-16 18:08:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3144 transitions. [2020-01-16 18:08:39,569 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3144 transitions. Word has length 25 [2020-01-16 18:08:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:39,569 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3144 transitions. [2020-01-16 18:08:39,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3144 transitions. [2020-01-16 18:08:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:39,570 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:39,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] [2020-01-16 18:08:39,571 INFO L426 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1899822195, now seen corresponding path program 555 times [2020-01-16 18:08:39,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:39,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367401620] [2020-01-16 18:08:39,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:40,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367401620] [2020-01-16 18:08:40,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:40,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:40,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138321639] [2020-01-16 18:08:40,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:40,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:40,034 INFO L87 Difference]: Start difference. First operand 791 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:08:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:40,199 INFO L93 Difference]: Finished difference Result 1427 states and 4980 transitions. [2020-01-16 18:08:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:40,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:40,203 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:08:40,204 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:08:40,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:08:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 795. [2020-01-16 18:08:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-01-16 18:08:40,226 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-01-16 18:08:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:40,226 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-01-16 18:08:40,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-01-16 18:08:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:40,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:40,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:40,227 INFO L426 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1393384175, now seen corresponding path program 556 times [2020-01-16 18:08:40,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:40,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827445538] [2020-01-16 18:08:40,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:40,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827445538] [2020-01-16 18:08:40,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:40,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:40,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473119715] [2020-01-16 18:08:40,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:40,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:40,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:40,688 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:08:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:40,841 INFO L93 Difference]: Finished difference Result 1428 states and 4978 transitions. [2020-01-16 18:08:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:40,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:40,844 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:08:40,844 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:08:40,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:08:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-01-16 18:08:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-01-16 18:08:40,866 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-01-16 18:08:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:40,866 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-01-16 18:08:40,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-01-16 18:08:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:40,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:40,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] [2020-01-16 18:08:40,868 INFO L426 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1954863573, now seen corresponding path program 557 times [2020-01-16 18:08:40,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:40,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206721909] [2020-01-16 18:08:40,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:41,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-01-16 18:08:41,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206721909] [2020-01-16 18:08:41,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:41,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:41,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743419983] [2020-01-16 18:08:41,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:41,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:41,309 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:08:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:41,461 INFO L93 Difference]: Finished difference Result 1434 states and 4991 transitions. [2020-01-16 18:08:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:41,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:41,465 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:08:41,465 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:08:41,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:08:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-01-16 18:08:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:08:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3149 transitions. [2020-01-16 18:08:41,488 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3149 transitions. Word has length 25 [2020-01-16 18:08:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:41,489 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3149 transitions. [2020-01-16 18:08:41,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3149 transitions. [2020-01-16 18:08:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:41,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:41,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:41,490 INFO L426 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -729162765, now seen corresponding path program 558 times [2020-01-16 18:08:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493587137] [2020-01-16 18:08:41,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:41,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493587137] [2020-01-16 18:08:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:41,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:41,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581147406] [2020-01-16 18:08:41,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:41,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:41,934 INFO L87 Difference]: Start difference. First operand 796 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:08:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:42,088 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-01-16 18:08:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:42,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:42,092 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:08:42,093 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:08:42,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:08:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 787. [2020-01-16 18:08:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:08:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-01-16 18:08:42,115 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-01-16 18:08:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:42,115 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-01-16 18:08:42,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-01-16 18:08:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:42,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:42,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:42,117 INFO L426 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:42,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:42,117 INFO L82 PathProgramCache]: Analyzing trace with hash -448697609, now seen corresponding path program 559 times [2020-01-16 18:08:42,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:42,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13543796] [2020-01-16 18:08:42,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:42,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13543796] [2020-01-16 18:08:42,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:42,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:42,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904273227] [2020-01-16 18:08:42,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:42,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:42,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:42,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:42,576 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:08:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:42,780 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-01-16 18:08:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:42,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:42,784 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:08:42,785 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:08:42,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:08:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 797. [2020-01-16 18:08:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:08:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-01-16 18:08:42,807 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-01-16 18:08:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:42,808 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-01-16 18:08:42,808 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-01-16 18:08:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:42,809 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:42,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:42,809 INFO L426 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 542560213, now seen corresponding path program 560 times [2020-01-16 18:08:42,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:42,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067067007] [2020-01-16 18:08:42,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:43,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-01-16 18:08:43,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067067007] [2020-01-16 18:08:43,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:43,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:43,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571214941] [2020-01-16 18:08:43,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:43,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:43,270 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:08:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:43,425 INFO L93 Difference]: Finished difference Result 1443 states and 5009 transitions. [2020-01-16 18:08:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:43,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:43,429 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:08:43,429 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:08:43,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:08:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 793. [2020-01-16 18:08:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-01-16 18:08:43,451 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-01-16 18:08:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:43,451 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-01-16 18:08:43,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-01-16 18:08:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:43,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:43,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] [2020-01-16 18:08:43,453 INFO L426 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash -891596749, now seen corresponding path program 561 times [2020-01-16 18:08:43,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:43,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653398559] [2020-01-16 18:08:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:43,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653398559] [2020-01-16 18:08:43,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:43,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:43,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172201406] [2020-01-16 18:08:43,910 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:43,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:43,911 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:08:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:44,064 INFO L93 Difference]: Finished difference Result 1443 states and 5008 transitions. [2020-01-16 18:08:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:44,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:44,068 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:08:44,069 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:08:44,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:08:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-01-16 18:08:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:08:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3154 transitions. [2020-01-16 18:08:44,092 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3154 transitions. Word has length 25 [2020-01-16 18:08:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:44,093 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3154 transitions. [2020-01-16 18:08:44,093 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3154 transitions. [2020-01-16 18:08:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:44,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:44,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] [2020-01-16 18:08:44,094 INFO L426 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 120667281, now seen corresponding path program 562 times [2020-01-16 18:08:44,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:44,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36353835] [2020-01-16 18:08:44,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:44,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36353835] [2020-01-16 18:08:44,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:44,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:44,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692165639] [2020-01-16 18:08:44,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:44,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:44,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:44,559 INFO L87 Difference]: Start difference. First operand 798 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:08:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:44,693 INFO L93 Difference]: Finished difference Result 1448 states and 5013 transitions. [2020-01-16 18:08:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:44,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:44,697 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:08:44,698 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:08:44,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:08:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 793. [2020-01-16 18:08:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:08:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-01-16 18:08:44,720 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-01-16 18:08:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:44,720 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-01-16 18:08:44,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-01-16 18:08:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:44,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:44,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] [2020-01-16 18:08:44,721 INFO L426 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1857974071, now seen corresponding path program 563 times [2020-01-16 18:08:44,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:44,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040762381] [2020-01-16 18:08:44,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:45,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-01-16 18:08:45,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040762381] [2020-01-16 18:08:45,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:45,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:45,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989749687] [2020-01-16 18:08:45,190 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:45,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:45,190 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:08:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:45,371 INFO L93 Difference]: Finished difference Result 1453 states and 5025 transitions. [2020-01-16 18:08:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:45,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:45,375 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:08:45,375 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:08:45,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:08:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 802. [2020-01-16 18:08:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:08:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3156 transitions. [2020-01-16 18:08:45,398 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3156 transitions. Word has length 25 [2020-01-16 18:08:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:45,398 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3156 transitions. [2020-01-16 18:08:45,398 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3156 transitions. [2020-01-16 18:08:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:45,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:45,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] [2020-01-16 18:08:45,399 INFO L426 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash 784888691, now seen corresponding path program 564 times [2020-01-16 18:08:45,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:45,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761931870] [2020-01-16 18:08:45,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:45,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761931870] [2020-01-16 18:08:45,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:45,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:45,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324193246] [2020-01-16 18:08:45,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:45,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:45,878 INFO L87 Difference]: Start difference. First operand 802 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:08:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:46,011 INFO L93 Difference]: Finished difference Result 1455 states and 5021 transitions. [2020-01-16 18:08:46,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:46,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:46,016 INFO L225 Difference]: With dead ends: 1455 [2020-01-16 18:08:46,016 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:08:46,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:08:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 787. [2020-01-16 18:08:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:08:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3123 transitions. [2020-01-16 18:08:46,038 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3123 transitions. Word has length 25 [2020-01-16 18:08:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:46,038 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3123 transitions. [2020-01-16 18:08:46,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3123 transitions. [2020-01-16 18:08:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:46,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:46,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:46,039 INFO L426 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1054850743, now seen corresponding path program 565 times [2020-01-16 18:08:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:46,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047391276] [2020-01-16 18:08:46,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:46,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-01-16 18:08:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047391276] [2020-01-16 18:08:46,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:46,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:46,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841432774] [2020-01-16 18:08:46,499 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:46,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:46,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:46,500 INFO L87 Difference]: Start difference. First operand 787 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:08:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:46,667 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-01-16 18:08:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:46,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:46,671 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:08:46,671 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:08:46,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:08:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-01-16 18:08:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:08:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-01-16 18:08:46,693 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-01-16 18:08:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:46,693 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-01-16 18:08:46,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-01-16 18:08:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:46,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:46,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:46,694 INFO L426 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2056611669, now seen corresponding path program 566 times [2020-01-16 18:08:46,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:46,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278503974] [2020-01-16 18:08:46,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:47,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278503974] [2020-01-16 18:08:47,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:47,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:47,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279514579] [2020-01-16 18:08:47,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:47,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:47,153 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:08:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:47,340 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-01-16 18:08:47,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:47,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:47,344 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:08:47,344 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:08:47,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:08:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 792. [2020-01-16 18:08:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:08:47,366 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:47,367 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:08:47,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:08:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:47,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:47,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:47,368 INFO L426 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1314082475, now seen corresponding path program 567 times [2020-01-16 18:08:47,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:47,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572897665] [2020-01-16 18:08:47,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:47,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572897665] [2020-01-16 18:08:47,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:47,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:47,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252329682] [2020-01-16 18:08:47,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:47,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:47,826 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:47,994 INFO L93 Difference]: Finished difference Result 1437 states and 4989 transitions. [2020-01-16 18:08:47,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:47,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:47,997 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:08:47,997 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:08:47,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:08:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-01-16 18:08:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:08:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3146 transitions. [2020-01-16 18:08:48,040 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3146 transitions. Word has length 25 [2020-01-16 18:08:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:48,040 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3146 transitions. [2020-01-16 18:08:48,040 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3146 transitions. [2020-01-16 18:08:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:48,041 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:48,041 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:48,041 INFO L426 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash -301818445, now seen corresponding path program 568 times [2020-01-16 18:08:48,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:48,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682301639] [2020-01-16 18:08:48,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:48,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682301639] [2020-01-16 18:08:48,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:48,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:48,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740080183] [2020-01-16 18:08:48,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:48,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:48,507 INFO L87 Difference]: Start difference. First operand 797 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:08:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:48,640 INFO L93 Difference]: Finished difference Result 1442 states and 4994 transitions. [2020-01-16 18:08:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:48,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:48,644 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:08:48,644 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:08:48,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:08:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-01-16 18:08:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3132 transitions. [2020-01-16 18:08:48,667 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3132 transitions. Word has length 25 [2020-01-16 18:08:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:48,667 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3132 transitions. [2020-01-16 18:08:48,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3132 transitions. [2020-01-16 18:08:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:48,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:48,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:48,668 INFO L426 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -922941769, now seen corresponding path program 569 times [2020-01-16 18:08:48,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:48,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794779011] [2020-01-16 18:08:48,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:49,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-01-16 18:08:49,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794779011] [2020-01-16 18:08:49,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:49,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:49,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519728865] [2020-01-16 18:08:49,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:49,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:49,133 INFO L87 Difference]: Start difference. First operand 792 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:08:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:49,300 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-01-16 18:08:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:49,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:49,305 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:08:49,305 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:08:49,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:08:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-01-16 18:08:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:08:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3143 transitions. [2020-01-16 18:08:49,327 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3143 transitions. Word has length 25 [2020-01-16 18:08:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:49,327 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3143 transitions. [2020-01-16 18:08:49,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3143 transitions. [2020-01-16 18:08:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:49,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:49,329 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:49,329 INFO L426 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 687999189, now seen corresponding path program 570 times [2020-01-16 18:08:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:49,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763092314] [2020-01-16 18:08:49,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:49,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763092314] [2020-01-16 18:08:49,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:49,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:49,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190771192] [2020-01-16 18:08:49,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:49,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:49,795 INFO L87 Difference]: Start difference. First operand 798 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:08:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:49,977 INFO L93 Difference]: Finished difference Result 1444 states and 4993 transitions. [2020-01-16 18:08:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:49,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:49,981 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:08:49,982 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:08:49,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:08:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 787. [2020-01-16 18:08:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:08:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3118 transitions. [2020-01-16 18:08:50,004 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3118 transitions. Word has length 25 [2020-01-16 18:08:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:50,004 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3118 transitions. [2020-01-16 18:08:50,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3118 transitions. [2020-01-16 18:08:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:50,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:50,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:50,005 INFO L426 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:50,006 INFO L82 PathProgramCache]: Analyzing trace with hash -216979789, now seen corresponding path program 571 times [2020-01-16 18:08:50,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:50,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508911040] [2020-01-16 18:08:50,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:50,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508911040] [2020-01-16 18:08:50,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:50,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:50,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730698072] [2020-01-16 18:08:50,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:50,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:50,456 INFO L87 Difference]: Start difference. First operand 787 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:08:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:50,617 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-01-16 18:08:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:50,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:50,621 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:08:50,622 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:08:50,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:08:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 799. [2020-01-16 18:08:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:08:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3151 transitions. [2020-01-16 18:08:50,645 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3151 transitions. Word has length 25 [2020-01-16 18:08:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:50,645 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3151 transitions. [2020-01-16 18:08:50,645 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3151 transitions. [2020-01-16 18:08:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:50,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:50,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:50,646 INFO L426 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1393961169, now seen corresponding path program 572 times [2020-01-16 18:08:50,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:50,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965383009] [2020-01-16 18:08:50,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:51,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-01-16 18:08:51,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965383009] [2020-01-16 18:08:51,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:51,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:51,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336809873] [2020-01-16 18:08:51,129 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:51,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:51,129 INFO L87 Difference]: Start difference. First operand 799 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:08:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:51,290 INFO L93 Difference]: Finished difference Result 1447 states and 5010 transitions. [2020-01-16 18:08:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:51,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:51,294 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:08:51,295 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:08:51,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:08:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 794. [2020-01-16 18:08:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:08:51,317 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:51,317 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:08:51,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:08:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:51,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:51,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:51,318 INFO L426 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1817417643, now seen corresponding path program 573 times [2020-01-16 18:08:51,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:51,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970134647] [2020-01-16 18:08:51,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:51,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970134647] [2020-01-16 18:08:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:51,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:51,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506852347] [2020-01-16 18:08:51,785 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:51,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:51,786 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:52,030 INFO L93 Difference]: Finished difference Result 1457 states and 5030 transitions. [2020-01-16 18:08:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:52,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:52,033 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:08:52,034 INFO L226 Difference]: Without dead ends: 1441 [2020-01-16 18:08:52,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-01-16 18:08:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 803. [2020-01-16 18:08:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:08:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3153 transitions. [2020-01-16 18:08:52,055 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3153 transitions. Word has length 25 [2020-01-16 18:08:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:52,055 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3153 transitions. [2020-01-16 18:08:52,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3153 transitions. [2020-01-16 18:08:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:52,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:52,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:52,057 INFO L426 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1404464273, now seen corresponding path program 574 times [2020-01-16 18:08:52,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:52,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752242654] [2020-01-16 18:08:52,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:52,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752242654] [2020-01-16 18:08:52,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:52,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:52,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520525011] [2020-01-16 18:08:52,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:52,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:52,525 INFO L87 Difference]: Start difference. First operand 803 states and 3153 transitions. Second operand 10 states. [2020-01-16 18:08:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:52,663 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-01-16 18:08:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:52,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:52,667 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:08:52,667 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:08:52,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:08:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-01-16 18:08:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3130 transitions. [2020-01-16 18:08:52,689 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3130 transitions. Word has length 25 [2020-01-16 18:08:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:52,690 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3130 transitions. [2020-01-16 18:08:52,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3130 transitions. [2020-01-16 18:08:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:52,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:52,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:52,691 INFO L426 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1806914539, now seen corresponding path program 575 times [2020-01-16 18:08:52,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:52,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645589332] [2020-01-16 18:08:52,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:53,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645589332] [2020-01-16 18:08:53,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:53,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:53,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195813992] [2020-01-16 18:08:53,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:53,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:53,153 INFO L87 Difference]: Start difference. First operand 794 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:08:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:53,318 INFO L93 Difference]: Finished difference Result 1450 states and 5008 transitions. [2020-01-16 18:08:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:53,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:53,322 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:08:53,323 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:08:53,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:08:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 800. [2020-01-16 18:08:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:08:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-01-16 18:08:53,346 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-01-16 18:08:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:53,346 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-01-16 18:08:53,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-01-16 18:08:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:53,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:53,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:53,347 INFO L426 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:53,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash -195973581, now seen corresponding path program 576 times [2020-01-16 18:08:53,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:53,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913937753] [2020-01-16 18:08:53,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:53,736 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-01-16 18:08:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:53,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913937753] [2020-01-16 18:08:53,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:53,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:53,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569453947] [2020-01-16 18:08:53,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:53,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:53,848 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:08:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:53,988 INFO L93 Difference]: Finished difference Result 1454 states and 5010 transitions. [2020-01-16 18:08:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:53,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:53,993 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:08:53,993 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:08:53,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:08:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 781. [2020-01-16 18:08:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:08:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:08:54,015 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:08:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:54,015 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:08:54,016 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:08:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:54,017 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:54,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:54,017 INFO L426 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1108890727, now seen corresponding path program 577 times [2020-01-16 18:08:54,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708049271] [2020-01-16 18:08:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:54,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708049271] [2020-01-16 18:08:54,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:54,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:54,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426865273] [2020-01-16 18:08:54,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:54,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:54,410 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:08:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:54,603 INFO L93 Difference]: Finished difference Result 1414 states and 4936 transitions. [2020-01-16 18:08:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:54,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:54,607 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:08:54,607 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:08:54,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:08:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-01-16 18:08:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3139 transitions. [2020-01-16 18:08:54,631 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3139 transitions. Word has length 25 [2020-01-16 18:08:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:54,631 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3139 transitions. [2020-01-16 18:08:54,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3139 transitions. [2020-01-16 18:08:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:54,632 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:54,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:54,632 INFO L426 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash 502050231, now seen corresponding path program 578 times [2020-01-16 18:08:54,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:54,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402733514] [2020-01-16 18:08:54,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:55,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402733514] [2020-01-16 18:08:55,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:55,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:55,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742992594] [2020-01-16 18:08:55,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:55,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:55,064 INFO L87 Difference]: Start difference. First operand 792 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:08:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:55,244 INFO L93 Difference]: Finished difference Result 1418 states and 4941 transitions. [2020-01-16 18:08:55,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:55,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:55,248 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:08:55,248 INFO L226 Difference]: Without dead ends: 1399 [2020-01-16 18:08:55,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-01-16 18:08:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 789. [2020-01-16 18:08:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3131 transitions. [2020-01-16 18:08:55,271 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3131 transitions. Word has length 25 [2020-01-16 18:08:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:55,271 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3131 transitions. [2020-01-16 18:08:55,271 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3131 transitions. [2020-01-16 18:08:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:55,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:55,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:55,272 INFO L426 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1585638715, now seen corresponding path program 579 times [2020-01-16 18:08:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:55,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375752609] [2020-01-16 18:08:55,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:55,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375752609] [2020-01-16 18:08:55,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:55,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:55,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253833249] [2020-01-16 18:08:55,712 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:55,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:55,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:55,712 INFO L87 Difference]: Start difference. First operand 789 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:08:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:55,891 INFO L93 Difference]: Finished difference Result 1412 states and 4929 transitions. [2020-01-16 18:08:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:55,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:55,894 INFO L225 Difference]: With dead ends: 1412 [2020-01-16 18:08:55,894 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:08:55,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:08:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 792. [2020-01-16 18:08:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:08:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3136 transitions. [2020-01-16 18:08:55,917 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3136 transitions. Word has length 25 [2020-01-16 18:08:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:55,917 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3136 transitions. [2020-01-16 18:08:55,917 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3136 transitions. [2020-01-16 18:08:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:55,918 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:55,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:55,918 INFO L426 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 512553335, now seen corresponding path program 580 times [2020-01-16 18:08:55,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:55,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050346337] [2020-01-16 18:08:55,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:56,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050346337] [2020-01-16 18:08:56,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:56,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:56,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552815209] [2020-01-16 18:08:56,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:56,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:56,359 INFO L87 Difference]: Start difference. First operand 792 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:08:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:56,546 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-01-16 18:08:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:56,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:56,549 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:08:56,550 INFO L226 Difference]: Without dead ends: 1397 [2020-01-16 18:08:56,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-01-16 18:08:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 789. [2020-01-16 18:08:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:08:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3128 transitions. [2020-01-16 18:08:56,595 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3128 transitions. Word has length 25 [2020-01-16 18:08:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:56,595 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3128 transitions. [2020-01-16 18:08:56,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3128 transitions. [2020-01-16 18:08:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:56,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:56,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] [2020-01-16 18:08:56,596 INFO L426 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1596141819, now seen corresponding path program 581 times [2020-01-16 18:08:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:56,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761083503] [2020-01-16 18:08:56,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:57,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761083503] [2020-01-16 18:08:57,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:57,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:57,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028172576] [2020-01-16 18:08:57,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:57,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:57,035 INFO L87 Difference]: Start difference. First operand 789 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:08:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:57,214 INFO L93 Difference]: Finished difference Result 1422 states and 4948 transitions. [2020-01-16 18:08:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:57,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:57,219 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:08:57,219 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:08:57,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:08:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-01-16 18:08:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-01-16 18:08:57,241 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-01-16 18:08:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:57,241 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-01-16 18:08:57,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-01-16 18:08:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:57,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:57,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:57,242 INFO L426 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1087884519, now seen corresponding path program 582 times [2020-01-16 18:08:57,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:57,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631957426] [2020-01-16 18:08:57,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:57,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-01-16 18:08:57,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631957426] [2020-01-16 18:08:57,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:57,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:57,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458796501] [2020-01-16 18:08:57,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:57,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:57,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:57,677 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:08:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:57,858 INFO L93 Difference]: Finished difference Result 1420 states and 4939 transitions. [2020-01-16 18:08:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:57,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:57,862 INFO L225 Difference]: With dead ends: 1420 [2020-01-16 18:08:57,862 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:08:57,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:08:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-01-16 18:08:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:08:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-01-16 18:08:57,885 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-01-16 18:08:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:57,885 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-01-16 18:08:57,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-01-16 18:08:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:57,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:57,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:57,887 INFO L426 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 817143351, now seen corresponding path program 583 times [2020-01-16 18:08:57,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:57,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576462442] [2020-01-16 18:08:57,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:58,233 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-01-16 18:08:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:58,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576462442] [2020-01-16 18:08:58,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:58,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:58,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416470221] [2020-01-16 18:08:58,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:58,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:58,344 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:08:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:58,506 INFO L93 Difference]: Finished difference Result 1425 states and 4956 transitions. [2020-01-16 18:08:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:58,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:58,510 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:08:58,510 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:08:58,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:08:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 794. [2020-01-16 18:08:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:08:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-01-16 18:08:58,532 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-01-16 18:08:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:58,532 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-01-16 18:08:58,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-01-16 18:08:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:58,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:58,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] [2020-01-16 18:08:58,534 INFO L426 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1866882987, now seen corresponding path program 584 times [2020-01-16 18:08:58,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:58,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447730378] [2020-01-16 18:08:58,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:58,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447730378] [2020-01-16 18:08:58,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:58,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802688273] [2020-01-16 18:08:58,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:58,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:58,966 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:08:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:59,109 INFO L93 Difference]: Finished difference Result 1429 states and 4961 transitions. [2020-01-16 18:08:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:59,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:59,113 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:08:59,113 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:08:59,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:08:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-01-16 18:08:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:08:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3133 transitions. [2020-01-16 18:08:59,136 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3133 transitions. Word has length 25 [2020-01-16 18:08:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:59,136 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3133 transitions. [2020-01-16 18:08:59,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3133 transitions. [2020-01-16 18:08:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:59,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:59,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:59,137 INFO L426 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1911234939, now seen corresponding path program 585 times [2020-01-16 18:08:59,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:59,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383881263] [2020-01-16 18:08:59,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:08:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:08:59,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383881263] [2020-01-16 18:08:59,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:08:59,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:08:59,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606292427] [2020-01-16 18:08:59,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:08:59,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:08:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:08:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:08:59,573 INFO L87 Difference]: Start difference. First operand 791 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:08:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:08:59,732 INFO L93 Difference]: Finished difference Result 1428 states and 4958 transitions. [2020-01-16 18:08:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:08:59,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:08:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:08:59,736 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:08:59,736 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:08:59,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:08:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:08:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:08:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:08:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3140 transitions. [2020-01-16 18:08:59,759 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3140 transitions. Word has length 25 [2020-01-16 18:08:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:08:59,759 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3140 transitions. [2020-01-16 18:08:59,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:08:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3140 transitions. [2020-01-16 18:08:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:08:59,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:08:59,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:08:59,760 INFO L426 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:08:59,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:08:59,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1845876779, now seen corresponding path program 586 times [2020-01-16 18:08:59,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:08:59,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548559372] [2020-01-16 18:08:59,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:08:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:00,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548559372] [2020-01-16 18:09:00,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:00,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:00,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355019765] [2020-01-16 18:09:00,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:00,199 INFO L87 Difference]: Start difference. First operand 795 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:09:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:00,342 INFO L93 Difference]: Finished difference Result 1434 states and 4966 transitions. [2020-01-16 18:09:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:00,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:00,346 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:09:00,347 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:09:00,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:00,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:09:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-01-16 18:09:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3129 transitions. [2020-01-16 18:09:00,369 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3129 transitions. Word has length 25 [2020-01-16 18:09:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:00,369 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3129 transitions. [2020-01-16 18:09:00,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3129 transitions. [2020-01-16 18:09:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:00,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:00,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:00,370 INFO L426 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1921738043, now seen corresponding path program 587 times [2020-01-16 18:09:00,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:00,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160079001] [2020-01-16 18:09:00,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:00,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160079001] [2020-01-16 18:09:00,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:00,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:00,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145778517] [2020-01-16 18:09:00,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:00,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:00,828 INFO L87 Difference]: Start difference. First operand 791 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:09:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:00,997 INFO L93 Difference]: Finished difference Result 1441 states and 4983 transitions. [2020-01-16 18:09:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:00,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:01,001 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:09:01,001 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:09:01,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:09:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 800. [2020-01-16 18:09:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:09:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3145 transitions. [2020-01-16 18:09:01,023 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3145 transitions. Word has length 25 [2020-01-16 18:09:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:01,023 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3145 transitions. [2020-01-16 18:09:01,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3145 transitions. [2020-01-16 18:09:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:01,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:01,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:01,025 INFO L426 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash 848652663, now seen corresponding path program 588 times [2020-01-16 18:09:01,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:01,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629212991] [2020-01-16 18:09:01,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:01,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629212991] [2020-01-16 18:09:01,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:01,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005115957] [2020-01-16 18:09:01,489 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:01,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:01,489 INFO L87 Difference]: Start difference. First operand 800 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:09:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:01,621 INFO L93 Difference]: Finished difference Result 1443 states and 4979 transitions. [2020-01-16 18:09:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:01,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:01,626 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:09:01,626 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:09:01,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:09:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2020-01-16 18:09:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:09:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3115 transitions. [2020-01-16 18:09:01,648 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3115 transitions. Word has length 25 [2020-01-16 18:09:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:01,648 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3115 transitions. [2020-01-16 18:09:01,648 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3115 transitions. [2020-01-16 18:09:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:01,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:01,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:01,649 INFO L426 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1142739575, now seen corresponding path program 589 times [2020-01-16 18:09:01,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:01,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776260938] [2020-01-16 18:09:01,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:02,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776260938] [2020-01-16 18:09:02,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:02,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:02,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429423316] [2020-01-16 18:09:02,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:02,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:02,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:02,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:02,097 INFO L87 Difference]: Start difference. First operand 786 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:09:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:02,269 INFO L93 Difference]: Finished difference Result 1417 states and 4934 transitions. [2020-01-16 18:09:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:02,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:02,273 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:09:02,273 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:09:02,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:09:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 793. [2020-01-16 18:09:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3134 transitions. [2020-01-16 18:09:02,295 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3134 transitions. Word has length 25 [2020-01-16 18:09:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:02,295 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3134 transitions. [2020-01-16 18:09:02,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3134 transitions. [2020-01-16 18:09:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:02,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:02,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:02,296 INFO L426 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash 69654195, now seen corresponding path program 590 times [2020-01-16 18:09:02,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:02,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58309884] [2020-01-16 18:09:02,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:02,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-01-16 18:09:02,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58309884] [2020-01-16 18:09:02,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:02,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:02,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058987170] [2020-01-16 18:09:02,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:02,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:02,761 INFO L87 Difference]: Start difference. First operand 793 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:09:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:02,924 INFO L93 Difference]: Finished difference Result 1419 states and 4935 transitions. [2020-01-16 18:09:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:02,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:02,928 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:09:02,928 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:09:02,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:09:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-01-16 18:09:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:09:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3126 transitions. [2020-01-16 18:09:02,950 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3126 transitions. Word has length 25 [2020-01-16 18:09:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:02,950 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3126 transitions. [2020-01-16 18:09:02,950 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3126 transitions. [2020-01-16 18:09:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:02,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:02,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:02,952 INFO L426 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash -457698279, now seen corresponding path program 591 times [2020-01-16 18:09:02,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:02,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810662470] [2020-01-16 18:09:02,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:03,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810662470] [2020-01-16 18:09:03,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:03,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:03,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920719213] [2020-01-16 18:09:03,392 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:03,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:03,392 INFO L87 Difference]: Start difference. First operand 790 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:09:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:03,553 INFO L93 Difference]: Finished difference Result 1422 states and 4940 transitions. [2020-01-16 18:09:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:03,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:03,557 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:09:03,557 INFO L226 Difference]: Without dead ends: 1410 [2020-01-16 18:09:03,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-01-16 18:09:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-01-16 18:09:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-01-16 18:09:03,590 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-01-16 18:09:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:03,590 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-01-16 18:09:03,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-01-16 18:09:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:03,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:03,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:03,592 INFO L426 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash 80157299, now seen corresponding path program 592 times [2020-01-16 18:09:03,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:03,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082462206] [2020-01-16 18:09:03,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:04,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082462206] [2020-01-16 18:09:04,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:04,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:04,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874162341] [2020-01-16 18:09:04,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:04,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:04,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:04,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:04,046 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:09:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:04,179 INFO L93 Difference]: Finished difference Result 1428 states and 4948 transitions. [2020-01-16 18:09:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:04,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:04,183 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:09:04,184 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:09:04,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:09:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 790. [2020-01-16 18:09:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:09:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3122 transitions. [2020-01-16 18:09:04,208 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3122 transitions. Word has length 25 [2020-01-16 18:09:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:04,208 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3122 transitions. [2020-01-16 18:09:04,208 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3122 transitions. [2020-01-16 18:09:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:04,209 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:04,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] [2020-01-16 18:09:04,209 INFO L426 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -436692071, now seen corresponding path program 593 times [2020-01-16 18:09:04,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:04,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714045126] [2020-01-16 18:09:04,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:04,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-01-16 18:09:04,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714045126] [2020-01-16 18:09:04,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:04,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:04,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610280105] [2020-01-16 18:09:04,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:04,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:04,656 INFO L87 Difference]: Start difference. First operand 790 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:09:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:04,803 INFO L93 Difference]: Finished difference Result 1428 states and 4950 transitions. [2020-01-16 18:09:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:04,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:04,807 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:09:04,807 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:09:04,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:09:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-01-16 18:09:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:09:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3133 transitions. [2020-01-16 18:09:04,830 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3133 transitions. Word has length 25 [2020-01-16 18:09:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:04,830 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3133 transitions. [2020-01-16 18:09:04,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3133 transitions. [2020-01-16 18:09:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:04,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:04,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:04,831 INFO L426 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1174248887, now seen corresponding path program 594 times [2020-01-16 18:09:04,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:04,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272138053] [2020-01-16 18:09:04,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:05,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-01-16 18:09:05,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272138053] [2020-01-16 18:09:05,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:05,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:05,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118554088] [2020-01-16 18:09:05,289 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:05,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:05,289 INFO L87 Difference]: Start difference. First operand 796 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:09:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:05,432 INFO L93 Difference]: Finished difference Result 1432 states and 4952 transitions. [2020-01-16 18:09:05,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:05,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:05,436 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:09:05,436 INFO L226 Difference]: Without dead ends: 1404 [2020-01-16 18:09:05,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-01-16 18:09:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 786. [2020-01-16 18:09:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:09:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3111 transitions. [2020-01-16 18:09:05,458 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3111 transitions. Word has length 25 [2020-01-16 18:09:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:05,458 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3111 transitions. [2020-01-16 18:09:05,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3111 transitions. [2020-01-16 18:09:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:05,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:05,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:05,460 INFO L426 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1215690539, now seen corresponding path program 595 times [2020-01-16 18:09:05,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:05,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748158619] [2020-01-16 18:09:05,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:05,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748158619] [2020-01-16 18:09:05,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:05,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:05,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17752614] [2020-01-16 18:09:05,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:05,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:05,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:05,964 INFO L87 Difference]: Start difference. First operand 786 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:09:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:06,128 INFO L93 Difference]: Finished difference Result 1441 states and 4989 transitions. [2020-01-16 18:09:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:06,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:06,132 INFO L225 Difference]: With dead ends: 1441 [2020-01-16 18:09:06,133 INFO L226 Difference]: Without dead ends: 1425 [2020-01-16 18:09:06,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-01-16 18:09:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 798. [2020-01-16 18:09:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-01-16 18:09:06,156 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-01-16 18:09:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:06,156 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-01-16 18:09:06,157 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-01-16 18:09:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:06,158 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:06,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] [2020-01-16 18:09:06,158 INFO L426 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:06,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:06,158 INFO L82 PathProgramCache]: Analyzing trace with hash 395250419, now seen corresponding path program 596 times [2020-01-16 18:09:06,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:06,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834284266] [2020-01-16 18:09:06,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:06,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-01-16 18:09:06,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834284266] [2020-01-16 18:09:06,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:06,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:06,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230812291] [2020-01-16 18:09:06,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:06,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:06,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:06,606 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:09:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:06,769 INFO L93 Difference]: Finished difference Result 1439 states and 4980 transitions. [2020-01-16 18:09:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:06,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:06,773 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:09:06,773 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:09:06,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:09:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 793. [2020-01-16 18:09:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-01-16 18:09:06,796 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-01-16 18:09:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:06,796 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-01-16 18:09:06,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-01-16 18:09:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:06,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:06,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:06,797 INFO L426 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1478838903, now seen corresponding path program 597 times [2020-01-16 18:09:06,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:06,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761606378] [2020-01-16 18:09:06,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:07,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761606378] [2020-01-16 18:09:07,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:07,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:07,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675444785] [2020-01-16 18:09:07,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:07,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:07,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:07,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:07,259 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:09:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:07,416 INFO L93 Difference]: Finished difference Result 1449 states and 5000 transitions. [2020-01-16 18:09:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:07,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:07,420 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:09:07,420 INFO L226 Difference]: Without dead ends: 1433 [2020-01-16 18:09:07,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-01-16 18:09:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-01-16 18:09:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:09:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3146 transitions. [2020-01-16 18:09:07,443 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3146 transitions. Word has length 25 [2020-01-16 18:09:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:07,443 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3146 transitions. [2020-01-16 18:09:07,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3146 transitions. [2020-01-16 18:09:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:07,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:07,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] [2020-01-16 18:09:07,445 INFO L426 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 405753523, now seen corresponding path program 598 times [2020-01-16 18:09:07,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:07,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439547187] [2020-01-16 18:09:07,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:07,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-01-16 18:09:07,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439547187] [2020-01-16 18:09:07,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:07,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:07,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467039924] [2020-01-16 18:09:07,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:07,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:07,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:07,918 INFO L87 Difference]: Start difference. First operand 802 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:09:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:08,041 INFO L93 Difference]: Finished difference Result 1451 states and 4996 transitions. [2020-01-16 18:09:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:08,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:08,045 INFO L225 Difference]: With dead ends: 1451 [2020-01-16 18:09:08,045 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:09:08,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:09:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-01-16 18:09:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3123 transitions. [2020-01-16 18:09:08,068 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3123 transitions. Word has length 25 [2020-01-16 18:09:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:08,068 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3123 transitions. [2020-01-16 18:09:08,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3123 transitions. [2020-01-16 18:09:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:08,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:08,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:08,069 INFO L426 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1489342007, now seen corresponding path program 599 times [2020-01-16 18:09:08,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:08,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438665636] [2020-01-16 18:09:08,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:08,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-01-16 18:09:08,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438665636] [2020-01-16 18:09:08,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:08,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:08,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653812627] [2020-01-16 18:09:08,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:08,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:08,522 INFO L87 Difference]: Start difference. First operand 793 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:09:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:08,694 INFO L93 Difference]: Finished difference Result 1442 states and 4978 transitions. [2020-01-16 18:09:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:08,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:08,698 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:09:08,699 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:09:08,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:09:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 799. [2020-01-16 18:09:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:09:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3134 transitions. [2020-01-16 18:09:08,722 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3134 transitions. Word has length 25 [2020-01-16 18:09:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:08,722 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3134 transitions. [2020-01-16 18:09:08,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3134 transitions. [2020-01-16 18:09:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:08,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:08,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:08,723 INFO L426 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1194684331, now seen corresponding path program 600 times [2020-01-16 18:09:08,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:08,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943559572] [2020-01-16 18:09:08,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:09,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-01-16 18:09:09,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943559572] [2020-01-16 18:09:09,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:09,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:09,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84957468] [2020-01-16 18:09:09,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:09,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:09,190 INFO L87 Difference]: Start difference. First operand 799 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:09:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:09,328 INFO L93 Difference]: Finished difference Result 1446 states and 4980 transitions. [2020-01-16 18:09:09,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:09,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:09,351 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:09:09,352 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:09:09,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:09:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 776. [2020-01-16 18:09:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:09:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3088 transitions. [2020-01-16 18:09:09,372 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3088 transitions. Word has length 25 [2020-01-16 18:09:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:09,372 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3088 transitions. [2020-01-16 18:09:09,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3088 transitions. [2020-01-16 18:09:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:09,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:09,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:09,374 INFO L426 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2008365005, now seen corresponding path program 601 times [2020-01-16 18:09:09,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:09,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183239468] [2020-01-16 18:09:09,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:09,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183239468] [2020-01-16 18:09:09,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:09,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:09,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470199073] [2020-01-16 18:09:09,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:09,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:09,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:09,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:09,820 INFO L87 Difference]: Start difference. First operand 776 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:09:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:09,968 INFO L93 Difference]: Finished difference Result 1421 states and 4973 transitions. [2020-01-16 18:09:09,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:09,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:09,972 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:09:09,972 INFO L226 Difference]: Without dead ends: 1406 [2020-01-16 18:09:09,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-01-16 18:09:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 792. [2020-01-16 18:09:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-01-16 18:09:09,995 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-01-16 18:09:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:09,995 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-01-16 18:09:09,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-01-16 18:09:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:09,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:09,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:09,996 INFO L426 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -397424047, now seen corresponding path program 602 times [2020-01-16 18:09:09,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:09,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245975836] [2020-01-16 18:09:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:10,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245975836] [2020-01-16 18:09:10,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:10,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:10,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124368089] [2020-01-16 18:09:10,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:10,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:10,442 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:09:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:10,593 INFO L93 Difference]: Finished difference Result 1418 states and 4964 transitions. [2020-01-16 18:09:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:10,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:10,597 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:09:10,598 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:09:10,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:09:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 789. [2020-01-16 18:09:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-01-16 18:09:10,620 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-01-16 18:09:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:10,620 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-01-16 18:09:10,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-01-16 18:09:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:10,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:10,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:10,621 INFO L426 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 686164437, now seen corresponding path program 603 times [2020-01-16 18:09:10,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:10,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845980499] [2020-01-16 18:09:10,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:11,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845980499] [2020-01-16 18:09:11,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:11,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:11,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479118332] [2020-01-16 18:09:11,073 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:11,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:11,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:11,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:11,073 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:09:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:11,224 INFO L93 Difference]: Finished difference Result 1428 states and 4987 transitions. [2020-01-16 18:09:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:11,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:11,228 INFO L225 Difference]: With dead ends: 1428 [2020-01-16 18:09:11,228 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:09:11,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:09:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 795. [2020-01-16 18:09:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3152 transitions. [2020-01-16 18:09:11,250 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3152 transitions. Word has length 25 [2020-01-16 18:09:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:11,250 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3152 transitions. [2020-01-16 18:09:11,250 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3152 transitions. [2020-01-16 18:09:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:11,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:11,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:11,251 INFO L426 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -386920943, now seen corresponding path program 604 times [2020-01-16 18:09:11,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:11,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830921721] [2020-01-16 18:09:11,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:11,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830921721] [2020-01-16 18:09:11,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:11,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:11,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038600434] [2020-01-16 18:09:11,701 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:11,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:11,701 INFO L87 Difference]: Start difference. First operand 795 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:09:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:11,858 INFO L93 Difference]: Finished difference Result 1429 states and 4983 transitions. [2020-01-16 18:09:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:11,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:11,862 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:09:11,863 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:09:11,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:09:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 789. [2020-01-16 18:09:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-01-16 18:09:11,885 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-01-16 18:09:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:11,885 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-01-16 18:09:11,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-01-16 18:09:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:11,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:11,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:11,886 INFO L426 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 696667541, now seen corresponding path program 605 times [2020-01-16 18:09:11,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:11,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248543824] [2020-01-16 18:09:11,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:12,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248543824] [2020-01-16 18:09:12,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:12,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:12,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366551713] [2020-01-16 18:09:12,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:12,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:12,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:12,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:12,336 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:09:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:12,480 INFO L93 Difference]: Finished difference Result 1419 states and 4963 transitions. [2020-01-16 18:09:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:12,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:12,484 INFO L225 Difference]: With dead ends: 1419 [2020-01-16 18:09:12,484 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:09:12,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:09:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 792. [2020-01-16 18:09:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3143 transitions. [2020-01-16 18:09:12,506 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3143 transitions. Word has length 25 [2020-01-16 18:09:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:12,506 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3143 transitions. [2020-01-16 18:09:12,506 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3143 transitions. [2020-01-16 18:09:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:12,507 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:12,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:12,508 INFO L426 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358797, now seen corresponding path program 606 times [2020-01-16 18:09:12,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:12,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652899124] [2020-01-16 18:09:12,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:12,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652899124] [2020-01-16 18:09:12,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:12,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:12,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60456324] [2020-01-16 18:09:12,978 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:12,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:12,978 INFO L87 Difference]: Start difference. First operand 792 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:09:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:13,142 INFO L93 Difference]: Finished difference Result 1423 states and 4968 transitions. [2020-01-16 18:09:13,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:13,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:13,146 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:09:13,146 INFO L226 Difference]: Without dead ends: 1401 [2020-01-16 18:09:13,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-01-16 18:09:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 786. [2020-01-16 18:09:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:09:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-01-16 18:09:13,168 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-01-16 18:09:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:13,168 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-01-16 18:09:13,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-01-16 18:09:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:13,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:13,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:13,169 INFO L426 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash -82330927, now seen corresponding path program 607 times [2020-01-16 18:09:13,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:13,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578205759] [2020-01-16 18:09:13,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:13,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578205759] [2020-01-16 18:09:13,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:13,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:13,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589002147] [2020-01-16 18:09:13,617 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:13,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:13,617 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:09:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:13,783 INFO L93 Difference]: Finished difference Result 1418 states and 4963 transitions. [2020-01-16 18:09:13,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:13,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:13,787 INFO L225 Difference]: With dead ends: 1418 [2020-01-16 18:09:13,787 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:09:13,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:09:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-01-16 18:09:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-01-16 18:09:13,809 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-01-16 18:09:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:13,809 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-01-16 18:09:13,809 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-01-16 18:09:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:13,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:13,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] [2020-01-16 18:09:13,810 INFO L426 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1528610031, now seen corresponding path program 608 times [2020-01-16 18:09:13,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:13,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561138637] [2020-01-16 18:09:13,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561138637] [2020-01-16 18:09:14,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:14,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:14,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901752392] [2020-01-16 18:09:14,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:14,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:14,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:14,253 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:09:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:14,428 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-01-16 18:09:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:14,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:14,432 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:09:14,432 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:09:14,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:09:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-01-16 18:09:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-01-16 18:09:14,455 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-01-16 18:09:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:14,455 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-01-16 18:09:14,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-01-16 18:09:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:14,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:14,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:14,456 INFO L426 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1011760661, now seen corresponding path program 609 times [2020-01-16 18:09:14,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:14,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589201584] [2020-01-16 18:09:14,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:14,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589201584] [2020-01-16 18:09:14,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:14,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:14,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344217777] [2020-01-16 18:09:14,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:14,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:14,902 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:09:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:15,084 INFO L93 Difference]: Finished difference Result 1422 states and 4970 transitions. [2020-01-16 18:09:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:15,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:15,088 INFO L225 Difference]: With dead ends: 1422 [2020-01-16 18:09:15,088 INFO L226 Difference]: Without dead ends: 1407 [2020-01-16 18:09:15,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-01-16 18:09:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 794. [2020-01-16 18:09:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-01-16 18:09:15,111 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-01-16 18:09:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:15,111 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-01-16 18:09:15,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-01-16 18:09:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:15,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:15,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] [2020-01-16 18:09:15,112 INFO L426 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:15,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616239, now seen corresponding path program 610 times [2020-01-16 18:09:15,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:15,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895968253] [2020-01-16 18:09:15,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:15,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895968253] [2020-01-16 18:09:15,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:15,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:15,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623578707] [2020-01-16 18:09:15,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:15,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:15,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:15,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:15,560 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:09:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:15,724 INFO L93 Difference]: Finished difference Result 1421 states and 4963 transitions. [2020-01-16 18:09:15,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:15,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:15,728 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:09:15,728 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:09:15,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:09:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-01-16 18:09:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3135 transitions. [2020-01-16 18:09:15,752 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3135 transitions. Word has length 25 [2020-01-16 18:09:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:15,752 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3135 transitions. [2020-01-16 18:09:15,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3135 transitions. [2020-01-16 18:09:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:15,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:15,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:15,753 INFO L426 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1022263765, now seen corresponding path program 611 times [2020-01-16 18:09:15,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:15,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339389625] [2020-01-16 18:09:15,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:16,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339389625] [2020-01-16 18:09:16,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:16,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:16,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805892778] [2020-01-16 18:09:16,222 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:16,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:16,223 INFO L87 Difference]: Start difference. First operand 789 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:09:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:16,383 INFO L93 Difference]: Finished difference Result 1414 states and 4949 transitions. [2020-01-16 18:09:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:16,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:16,387 INFO L225 Difference]: With dead ends: 1414 [2020-01-16 18:09:16,387 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:09:16,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:09:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-01-16 18:09:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-01-16 18:09:16,410 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-01-16 18:09:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:16,410 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-01-16 18:09:16,410 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-01-16 18:09:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:16,412 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:16,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:16,412 INFO L426 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash -50821615, now seen corresponding path program 612 times [2020-01-16 18:09:16,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:16,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210604341] [2020-01-16 18:09:16,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:16,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210604341] [2020-01-16 18:09:16,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:16,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:16,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124220415] [2020-01-16 18:09:16,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:16,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:16,849 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:09:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:17,024 INFO L93 Difference]: Finished difference Result 1416 states and 4950 transitions. [2020-01-16 18:09:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:17,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:17,028 INFO L225 Difference]: With dead ends: 1416 [2020-01-16 18:09:17,028 INFO L226 Difference]: Without dead ends: 1396 [2020-01-16 18:09:17,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-01-16 18:09:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-01-16 18:09:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:09:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3127 transitions. [2020-01-16 18:09:17,050 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3127 transitions. Word has length 25 [2020-01-16 18:09:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:17,051 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3127 transitions. [2020-01-16 18:09:17,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3127 transitions. [2020-01-16 18:09:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:17,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:17,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:17,052 INFO L426 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 243265297, now seen corresponding path program 613 times [2020-01-16 18:09:17,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:17,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595543694] [2020-01-16 18:09:17,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:17,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-01-16 18:09:17,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595543694] [2020-01-16 18:09:17,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:17,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:17,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288721556] [2020-01-16 18:09:17,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:17,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:17,502 INFO L87 Difference]: Start difference. First operand 786 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:09:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:17,656 INFO L93 Difference]: Finished difference Result 1436 states and 5008 transitions. [2020-01-16 18:09:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:17,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:17,660 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:09:17,661 INFO L226 Difference]: Without dead ends: 1421 [2020-01-16 18:09:17,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-01-16 18:09:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 797. [2020-01-16 18:09:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3157 transitions. [2020-01-16 18:09:17,683 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3157 transitions. Word has length 25 [2020-01-16 18:09:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:17,683 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3157 transitions. [2020-01-16 18:09:17,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3157 transitions. [2020-01-16 18:09:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:17,684 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:17,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:17,684 INFO L426 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash -829820083, now seen corresponding path program 614 times [2020-01-16 18:09:17,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:17,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854714871] [2020-01-16 18:09:17,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:18,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-01-16 18:09:18,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854714871] [2020-01-16 18:09:18,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:18,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:18,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994000279] [2020-01-16 18:09:18,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:18,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:18,137 INFO L87 Difference]: Start difference. First operand 797 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:09:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:18,303 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-01-16 18:09:18,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:18,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:18,307 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:09:18,307 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:09:18,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:09:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-01-16 18:09:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3141 transitions. [2020-01-16 18:09:18,329 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3141 transitions. Word has length 25 [2020-01-16 18:09:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:18,329 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3141 transitions. [2020-01-16 18:09:18,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3141 transitions. [2020-01-16 18:09:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:18,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:18,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:18,331 INFO L426 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1357172557, now seen corresponding path program 615 times [2020-01-16 18:09:18,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:18,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316335999] [2020-01-16 18:09:18,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:18,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316335999] [2020-01-16 18:09:18,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:18,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:18,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724802749] [2020-01-16 18:09:18,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:18,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:18,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:18,781 INFO L87 Difference]: Start difference. First operand 791 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:09:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:18,965 INFO L93 Difference]: Finished difference Result 1433 states and 4996 transitions. [2020-01-16 18:09:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:18,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:18,969 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:09:18,969 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:09:18,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:09:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-01-16 18:09:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:09:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3150 transitions. [2020-01-16 18:09:18,992 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3150 transitions. Word has length 25 [2020-01-16 18:09:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:18,992 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3150 transitions. [2020-01-16 18:09:18,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3150 transitions. [2020-01-16 18:09:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:18,993 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:18,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] [2020-01-16 18:09:18,993 INFO L426 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -819316979, now seen corresponding path program 616 times [2020-01-16 18:09:18,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:18,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740524707] [2020-01-16 18:09:18,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:19,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740524707] [2020-01-16 18:09:19,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:19,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:19,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144656120] [2020-01-16 18:09:19,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:19,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:19,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:19,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:19,466 INFO L87 Difference]: Start difference. First operand 796 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:09:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:19,638 INFO L93 Difference]: Finished difference Result 1432 states and 4989 transitions. [2020-01-16 18:09:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:19,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:19,642 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:09:19,642 INFO L226 Difference]: Without dead ends: 1413 [2020-01-16 18:09:19,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-01-16 18:09:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 791. [2020-01-16 18:09:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-01-16 18:09:19,665 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-01-16 18:09:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:19,665 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-01-16 18:09:19,665 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-01-16 18:09:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:19,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:19,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:19,666 INFO L426 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1336166349, now seen corresponding path program 617 times [2020-01-16 18:09:19,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:19,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136607704] [2020-01-16 18:09:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:20,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136607704] [2020-01-16 18:09:20,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:20,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:20,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820812494] [2020-01-16 18:09:20,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:20,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:20,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:20,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:20,112 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:09:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:20,282 INFO L93 Difference]: Finished difference Result 1435 states and 4995 transitions. [2020-01-16 18:09:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:20,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:20,286 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:09:20,286 INFO L226 Difference]: Without dead ends: 1419 [2020-01-16 18:09:20,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-01-16 18:09:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-01-16 18:09:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:09:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-01-16 18:09:20,309 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-01-16 18:09:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:20,309 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-01-16 18:09:20,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-01-16 18:09:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:20,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:20,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] [2020-01-16 18:09:20,310 INFO L426 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash 274774609, now seen corresponding path program 618 times [2020-01-16 18:09:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:20,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105115828] [2020-01-16 18:09:20,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:20,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105115828] [2020-01-16 18:09:20,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:20,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:20,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227642641] [2020-01-16 18:09:20,758 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:20,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:20,758 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:09:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:20,921 INFO L93 Difference]: Finished difference Result 1433 states and 4986 transitions. [2020-01-16 18:09:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:20,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:20,926 INFO L225 Difference]: With dead ends: 1433 [2020-01-16 18:09:20,926 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:09:20,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:09:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 786. [2020-01-16 18:09:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:09:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3124 transitions. [2020-01-16 18:09:20,949 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3124 transitions. Word has length 25 [2020-01-16 18:09:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:20,949 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3124 transitions. [2020-01-16 18:09:20,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3124 transitions. [2020-01-16 18:09:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:20,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:20,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:20,950 INFO L426 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:20,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2115164817, now seen corresponding path program 619 times [2020-01-16 18:09:20,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:20,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905164689] [2020-01-16 18:09:20,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:21,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905164689] [2020-01-16 18:09:21,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:21,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:21,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338915184] [2020-01-16 18:09:21,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:21,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:21,382 INFO L87 Difference]: Start difference. First operand 786 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:09:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:21,532 INFO L93 Difference]: Finished difference Result 1417 states and 4955 transitions. [2020-01-16 18:09:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:21,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:21,536 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:09:21,536 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:09:21,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:09:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 792. [2020-01-16 18:09:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-01-16 18:09:21,560 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-01-16 18:09:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:21,560 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-01-16 18:09:21,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-01-16 18:09:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:21,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:21,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:21,561 INFO L426 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -504223859, now seen corresponding path program 620 times [2020-01-16 18:09:21,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:21,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491014008] [2020-01-16 18:09:21,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:21,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491014008] [2020-01-16 18:09:21,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:21,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:21,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560141110] [2020-01-16 18:09:21,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:21,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:21,994 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:09:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:22,168 INFO L93 Difference]: Finished difference Result 1421 states and 4960 transitions. [2020-01-16 18:09:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:22,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:22,172 INFO L225 Difference]: With dead ends: 1421 [2020-01-16 18:09:22,173 INFO L226 Difference]: Without dead ends: 1402 [2020-01-16 18:09:22,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-01-16 18:09:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-01-16 18:09:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-01-16 18:09:22,194 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-01-16 18:09:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:22,195 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-01-16 18:09:22,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-01-16 18:09:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:22,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:22,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] [2020-01-16 18:09:22,196 INFO L426 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 579364625, now seen corresponding path program 621 times [2020-01-16 18:09:22,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:22,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515456462] [2020-01-16 18:09:22,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:22,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515456462] [2020-01-16 18:09:22,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:22,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:22,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218265369] [2020-01-16 18:09:22,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:22,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:22,636 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:09:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:22,821 INFO L93 Difference]: Finished difference Result 1415 states and 4948 transitions. [2020-01-16 18:09:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:22,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:22,825 INFO L225 Difference]: With dead ends: 1415 [2020-01-16 18:09:22,825 INFO L226 Difference]: Without dead ends: 1403 [2020-01-16 18:09:22,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-01-16 18:09:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-01-16 18:09:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-01-16 18:09:22,848 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-01-16 18:09:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:22,848 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-01-16 18:09:22,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-01-16 18:09:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:22,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:22,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:22,849 INFO L426 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -493720755, now seen corresponding path program 622 times [2020-01-16 18:09:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:22,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793008578] [2020-01-16 18:09:22,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:23,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793008578] [2020-01-16 18:09:23,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:23,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:23,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858023226] [2020-01-16 18:09:23,273 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:23,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:23,273 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:09:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:23,428 INFO L93 Difference]: Finished difference Result 1417 states and 4949 transitions. [2020-01-16 18:09:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:23,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:23,431 INFO L225 Difference]: With dead ends: 1417 [2020-01-16 18:09:23,432 INFO L226 Difference]: Without dead ends: 1400 [2020-01-16 18:09:23,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-01-16 18:09:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-01-16 18:09:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-01-16 18:09:23,454 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-01-16 18:09:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:23,454 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-01-16 18:09:23,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-01-16 18:09:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:23,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:23,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:23,456 INFO L426 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 589867729, now seen corresponding path program 623 times [2020-01-16 18:09:23,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:23,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217931338] [2020-01-16 18:09:23,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:23,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217931338] [2020-01-16 18:09:23,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:23,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:23,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769048360] [2020-01-16 18:09:23,894 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:23,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:23,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:23,894 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-01-16 18:09:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:24,059 INFO L93 Difference]: Finished difference Result 1425 states and 4967 transitions. [2020-01-16 18:09:24,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:24,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:24,063 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:09:24,063 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:09:24,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:09:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-01-16 18:09:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-01-16 18:09:24,086 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-01-16 18:09:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:24,086 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-01-16 18:09:24,086 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-01-16 18:09:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:24,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:24,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:24,088 INFO L426 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2094158609, now seen corresponding path program 624 times [2020-01-16 18:09:24,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:24,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994800975] [2020-01-16 18:09:24,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994800975] [2020-01-16 18:09:24,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:24,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:24,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109577874] [2020-01-16 18:09:24,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:24,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:24,525 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:09:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:24,687 INFO L93 Difference]: Finished difference Result 1423 states and 4958 transitions. [2020-01-16 18:09:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:24,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:24,692 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:09:24,692 INFO L226 Difference]: Without dead ends: 1398 [2020-01-16 18:09:24,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-01-16 18:09:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 783. [2020-01-16 18:09:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:09:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:09:24,715 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:09:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:24,715 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:09:24,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:09:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:24,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:24,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:24,716 INFO L426 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1864116565, now seen corresponding path program 625 times [2020-01-16 18:09:24,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:24,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444713202] [2020-01-16 18:09:24,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444713202] [2020-01-16 18:09:25,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:25,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832205514] [2020-01-16 18:09:25,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:25,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:25,163 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:09:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:25,339 INFO L93 Difference]: Finished difference Result 1442 states and 5020 transitions. [2020-01-16 18:09:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:25,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:25,343 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:09:25,343 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:09:25,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:09:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 795. [2020-01-16 18:09:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-01-16 18:09:25,365 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-01-16 18:09:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:25,365 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-01-16 18:09:25,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-01-16 18:09:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:25,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:25,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:25,367 INFO L426 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash -819909773, now seen corresponding path program 626 times [2020-01-16 18:09:25,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:25,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228788112] [2020-01-16 18:09:25,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:25,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228788112] [2020-01-16 18:09:25,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:25,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:25,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453316315] [2020-01-16 18:09:25,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:25,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:25,820 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:09:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:26,013 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-01-16 18:09:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:26,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:26,017 INFO L225 Difference]: With dead ends: 1439 [2020-01-16 18:09:26,017 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:09:26,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:09:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-01-16 18:09:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-01-16 18:09:26,039 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-01-16 18:09:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:26,039 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-01-16 18:09:26,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-01-16 18:09:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:26,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:26,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:26,040 INFO L426 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash 263678711, now seen corresponding path program 627 times [2020-01-16 18:09:26,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:26,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350817549] [2020-01-16 18:09:26,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:26,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-01-16 18:09:26,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350817549] [2020-01-16 18:09:26,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:26,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:26,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811040562] [2020-01-16 18:09:26,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:26,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:26,504 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:09:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:26,670 INFO L93 Difference]: Finished difference Result 1449 states and 5034 transitions. [2020-01-16 18:09:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:26,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:26,674 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:09:26,674 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:09:26,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:09:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 798. [2020-01-16 18:09:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3158 transitions. [2020-01-16 18:09:26,696 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3158 transitions. Word has length 25 [2020-01-16 18:09:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:26,696 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3158 transitions. [2020-01-16 18:09:26,696 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3158 transitions. [2020-01-16 18:09:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:26,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:26,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] [2020-01-16 18:09:26,698 INFO L426 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash -809406669, now seen corresponding path program 628 times [2020-01-16 18:09:26,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:26,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652047035] [2020-01-16 18:09:26,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652047035] [2020-01-16 18:09:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:27,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:27,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084312280] [2020-01-16 18:09:27,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:27,150 INFO L87 Difference]: Start difference. First operand 798 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:09:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:27,328 INFO L93 Difference]: Finished difference Result 1450 states and 5030 transitions. [2020-01-16 18:09:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:27,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:27,332 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:09:27,332 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:09:27,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:09:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 792. [2020-01-16 18:09:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:09:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-01-16 18:09:27,355 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-01-16 18:09:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:27,355 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-01-16 18:09:27,355 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-01-16 18:09:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:27,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:27,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] [2020-01-16 18:09:27,356 INFO L426 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash 274181815, now seen corresponding path program 629 times [2020-01-16 18:09:27,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:27,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153038259] [2020-01-16 18:09:27,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:27,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-01-16 18:09:27,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153038259] [2020-01-16 18:09:27,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:27,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:27,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474199317] [2020-01-16 18:09:27,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:27,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:27,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:27,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:27,809 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:09:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:27,984 INFO L93 Difference]: Finished difference Result 1440 states and 5010 transitions. [2020-01-16 18:09:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:27,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:27,988 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:09:27,988 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:09:27,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:09:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 795. [2020-01-16 18:09:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3149 transitions. [2020-01-16 18:09:28,010 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3149 transitions. Word has length 25 [2020-01-16 18:09:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:28,010 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3149 transitions. [2020-01-16 18:09:28,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3149 transitions. [2020-01-16 18:09:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:28,011 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:28,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:28,011 INFO L426 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1885122773, now seen corresponding path program 630 times [2020-01-16 18:09:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886311433] [2020-01-16 18:09:28,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:28,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886311433] [2020-01-16 18:09:28,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:28,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:28,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664854952] [2020-01-16 18:09:28,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:28,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:28,465 INFO L87 Difference]: Start difference. First operand 795 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:09:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:28,625 INFO L93 Difference]: Finished difference Result 1444 states and 5015 transitions. [2020-01-16 18:09:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:28,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:28,629 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:09:28,629 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:09:28,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:09:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 789. [2020-01-16 18:09:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-01-16 18:09:28,651 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-01-16 18:09:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:28,651 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-01-16 18:09:28,651 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-01-16 18:09:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:28,652 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:28,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:28,652 INFO L426 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1421217425, now seen corresponding path program 631 times [2020-01-16 18:09:28,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:28,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544986784] [2020-01-16 18:09:28,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:29,115 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-01-16 18:09:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:29,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544986784] [2020-01-16 18:09:29,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:29,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:29,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076613518] [2020-01-16 18:09:29,121 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:29,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:29,122 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:09:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:29,306 INFO L93 Difference]: Finished difference Result 1447 states and 5027 transitions. [2020-01-16 18:09:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:29,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:29,310 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:09:29,310 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:09:29,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:09:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 796. [2020-01-16 18:09:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:09:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3155 transitions. [2020-01-16 18:09:29,331 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3155 transitions. Word has length 25 [2020-01-16 18:09:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:29,332 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3155 transitions. [2020-01-16 18:09:29,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3155 transitions. [2020-01-16 18:09:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:29,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:29,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] [2020-01-16 18:09:29,333 INFO L426 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:29,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1262808913, now seen corresponding path program 632 times [2020-01-16 18:09:29,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:29,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707298698] [2020-01-16 18:09:29,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:29,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707298698] [2020-01-16 18:09:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297886353] [2020-01-16 18:09:29,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:29,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:29,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:29,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:29,790 INFO L87 Difference]: Start difference. First operand 796 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:09:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:29,953 INFO L93 Difference]: Finished difference Result 1444 states and 5018 transitions. [2020-01-16 18:09:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:29,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:29,957 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:09:29,957 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:09:29,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:09:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-01-16 18:09:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3147 transitions. [2020-01-16 18:09:29,980 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3147 transitions. Word has length 25 [2020-01-16 18:09:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:29,980 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3147 transitions. [2020-01-16 18:09:29,980 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3147 transitions. [2020-01-16 18:09:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:29,981 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:29,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] [2020-01-16 18:09:29,981 INFO L426 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 914871159, now seen corresponding path program 633 times [2020-01-16 18:09:29,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:29,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714360889] [2020-01-16 18:09:29,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:30,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-01-16 18:09:30,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714360889] [2020-01-16 18:09:30,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:30,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:30,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094567974] [2020-01-16 18:09:30,443 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:30,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:30,448 INFO L87 Difference]: Start difference. First operand 793 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:09:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:30,614 INFO L93 Difference]: Finished difference Result 1457 states and 5046 transitions. [2020-01-16 18:09:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:30,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:30,618 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:09:30,618 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:09:30,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:09:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 800. [2020-01-16 18:09:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:09:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3160 transitions. [2020-01-16 18:09:30,642 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3160 transitions. Word has length 25 [2020-01-16 18:09:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:30,642 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3160 transitions. [2020-01-16 18:09:30,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3160 transitions. [2020-01-16 18:09:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:30,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:30,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:30,643 INFO L426 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1231299601, now seen corresponding path program 634 times [2020-01-16 18:09:30,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:30,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956373839] [2020-01-16 18:09:30,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:31,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956373839] [2020-01-16 18:09:31,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:31,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:31,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763404542] [2020-01-16 18:09:31,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:31,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:31,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:31,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:31,108 INFO L87 Difference]: Start difference. First operand 800 states and 3160 transitions. Second operand 10 states. [2020-01-16 18:09:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:31,237 INFO L93 Difference]: Finished difference Result 1460 states and 5045 transitions. [2020-01-16 18:09:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:31,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:31,241 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:09:31,241 INFO L226 Difference]: Without dead ends: 1435 [2020-01-16 18:09:31,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-01-16 18:09:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 793. [2020-01-16 18:09:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-01-16 18:09:31,264 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-01-16 18:09:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:31,264 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-01-16 18:09:31,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-01-16 18:09:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:31,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:31,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:31,265 INFO L426 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 925374263, now seen corresponding path program 635 times [2020-01-16 18:09:31,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:31,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730042776] [2020-01-16 18:09:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:31,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730042776] [2020-01-16 18:09:31,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:31,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:31,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788373335] [2020-01-16 18:09:31,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:31,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:31,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:31,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:31,723 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:09:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:31,902 INFO L93 Difference]: Finished difference Result 1448 states and 5021 transitions. [2020-01-16 18:09:31,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:31,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:31,906 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:09:31,907 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:09:31,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:09:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-01-16 18:09:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3150 transitions. [2020-01-16 18:09:31,930 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3150 transitions. Word has length 25 [2020-01-16 18:09:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:31,930 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3150 transitions. [2020-01-16 18:09:31,930 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3150 transitions. [2020-01-16 18:09:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:31,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:31,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:31,931 INFO L426 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:31,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1463229841, now seen corresponding path program 636 times [2020-01-16 18:09:31,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:31,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882346438] [2020-01-16 18:09:31,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:32,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882346438] [2020-01-16 18:09:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:32,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:32,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472433674] [2020-01-16 18:09:32,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:32,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:32,412 INFO L87 Difference]: Start difference. First operand 797 states and 3150 transitions. Second operand 10 states. [2020-01-16 18:09:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:32,537 INFO L93 Difference]: Finished difference Result 1454 states and 5029 transitions. [2020-01-16 18:09:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:32,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:32,541 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:09:32,541 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:09:32,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:09:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 789. [2020-01-16 18:09:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-01-16 18:09:32,563 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-01-16 18:09:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:32,563 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-01-16 18:09:32,563 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-01-16 18:09:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:32,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:32,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:32,564 INFO L426 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1746813649, now seen corresponding path program 637 times [2020-01-16 18:09:32,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:32,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323918845] [2020-01-16 18:09:32,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:33,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323918845] [2020-01-16 18:09:33,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:33,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:33,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613417311] [2020-01-16 18:09:33,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:33,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:33,026 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:09:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:33,200 INFO L93 Difference]: Finished difference Result 1471 states and 5085 transitions. [2020-01-16 18:09:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:33,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:33,203 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:09:33,203 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:09:33,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:09:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 804. [2020-01-16 18:09:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:09:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3172 transitions. [2020-01-16 18:09:33,226 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3172 transitions. Word has length 25 [2020-01-16 18:09:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:33,226 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3172 transitions. [2020-01-16 18:09:33,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3172 transitions. [2020-01-16 18:09:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:33,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:33,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:33,228 INFO L426 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 673728269, now seen corresponding path program 638 times [2020-01-16 18:09:33,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:33,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755383453] [2020-01-16 18:09:33,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:33,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755383453] [2020-01-16 18:09:33,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:33,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:33,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471238524] [2020-01-16 18:09:33,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:33,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:33,699 INFO L87 Difference]: Start difference. First operand 804 states and 3172 transitions. Second operand 10 states. [2020-01-16 18:09:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:33,866 INFO L93 Difference]: Finished difference Result 1472 states and 5081 transitions. [2020-01-16 18:09:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:33,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:33,869 INFO L225 Difference]: With dead ends: 1472 [2020-01-16 18:09:33,869 INFO L226 Difference]: Without dead ends: 1450 [2020-01-16 18:09:33,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-01-16 18:09:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-01-16 18:09:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3155 transitions. [2020-01-16 18:09:33,891 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3155 transitions. Word has length 25 [2020-01-16 18:09:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:33,891 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3155 transitions. [2020-01-16 18:09:33,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3155 transitions. [2020-01-16 18:09:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:33,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:33,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:33,892 INFO L426 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1454062059, now seen corresponding path program 639 times [2020-01-16 18:09:33,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:33,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854135639] [2020-01-16 18:09:33,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:34,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854135639] [2020-01-16 18:09:34,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:34,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:34,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203658894] [2020-01-16 18:09:34,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:34,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:34,370 INFO L87 Difference]: Start difference. First operand 798 states and 3155 transitions. Second operand 10 states. [2020-01-16 18:09:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:34,518 INFO L93 Difference]: Finished difference Result 1474 states and 5084 transitions. [2020-01-16 18:09:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:34,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:34,522 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:09:34,523 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:09:34,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:09:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 805. [2020-01-16 18:09:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:09:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3168 transitions. [2020-01-16 18:09:34,545 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3168 transitions. Word has length 25 [2020-01-16 18:09:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:34,545 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3168 transitions. [2020-01-16 18:09:34,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3168 transitions. [2020-01-16 18:09:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:34,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:34,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:34,546 INFO L426 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 694734477, now seen corresponding path program 640 times [2020-01-16 18:09:34,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:34,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278661596] [2020-01-16 18:09:34,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:35,028 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-01-16 18:09:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:35,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278661596] [2020-01-16 18:09:35,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:35,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702923936] [2020-01-16 18:09:35,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:35,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:35,035 INFO L87 Difference]: Start difference. First operand 805 states and 3168 transitions. Second operand 10 states. [2020-01-16 18:09:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:35,167 INFO L93 Difference]: Finished difference Result 1477 states and 5083 transitions. [2020-01-16 18:09:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:35,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:35,172 INFO L225 Difference]: With dead ends: 1477 [2020-01-16 18:09:35,172 INFO L226 Difference]: Without dead ends: 1452 [2020-01-16 18:09:35,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-01-16 18:09:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 798. [2020-01-16 18:09:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3148 transitions. [2020-01-16 18:09:35,195 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3148 transitions. Word has length 25 [2020-01-16 18:09:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:35,195 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3148 transitions. [2020-01-16 18:09:35,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3148 transitions. [2020-01-16 18:09:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:35,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:35,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:35,197 INFO L426 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1433055851, now seen corresponding path program 641 times [2020-01-16 18:09:35,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:35,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090354538] [2020-01-16 18:09:35,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:35,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-01-16 18:09:35,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090354538] [2020-01-16 18:09:35,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:35,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:35,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786660620] [2020-01-16 18:09:35,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:35,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:35,668 INFO L87 Difference]: Start difference. First operand 798 states and 3148 transitions. Second operand 10 states. [2020-01-16 18:09:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:35,846 INFO L93 Difference]: Finished difference Result 1478 states and 5085 transitions. [2020-01-16 18:09:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:35,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:35,850 INFO L225 Difference]: With dead ends: 1478 [2020-01-16 18:09:35,850 INFO L226 Difference]: Without dead ends: 1462 [2020-01-16 18:09:35,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-01-16 18:09:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 807. [2020-01-16 18:09:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:09:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3164 transitions. [2020-01-16 18:09:35,873 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3164 transitions. Word has length 25 [2020-01-16 18:09:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:35,873 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3164 transitions. [2020-01-16 18:09:35,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3164 transitions. [2020-01-16 18:09:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:35,874 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:35,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:35,874 INFO L426 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1788826065, now seen corresponding path program 642 times [2020-01-16 18:09:35,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:35,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270587785] [2020-01-16 18:09:35,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:36,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270587785] [2020-01-16 18:09:36,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789050719] [2020-01-16 18:09:36,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:36,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:36,351 INFO L87 Difference]: Start difference. First operand 807 states and 3164 transitions. Second operand 10 states. [2020-01-16 18:09:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:36,507 INFO L93 Difference]: Finished difference Result 1480 states and 5081 transitions. [2020-01-16 18:09:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:36,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:36,511 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:09:36,511 INFO L226 Difference]: Without dead ends: 1444 [2020-01-16 18:09:36,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-01-16 18:09:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 789. [2020-01-16 18:09:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-01-16 18:09:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3126 transitions. [2020-01-16 18:09:36,533 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3126 transitions. Word has length 25 [2020-01-16 18:09:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:36,534 INFO L478 AbstractCegarLoop]: Abstraction has 789 states and 3126 transitions. [2020-01-16 18:09:36,534 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3126 transitions. [2020-01-16 18:09:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:36,535 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:36,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] [2020-01-16 18:09:36,535 INFO L426 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -611616465, now seen corresponding path program 643 times [2020-01-16 18:09:36,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:36,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423396447] [2020-01-16 18:09:36,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:36,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423396447] [2020-01-16 18:09:36,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:36,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236579910] [2020-01-16 18:09:36,998 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:36,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:36,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:36,998 INFO L87 Difference]: Start difference. First operand 789 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:09:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:37,173 INFO L93 Difference]: Finished difference Result 1449 states and 5021 transitions. [2020-01-16 18:09:37,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:37,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:37,178 INFO L225 Difference]: With dead ends: 1449 [2020-01-16 18:09:37,178 INFO L226 Difference]: Without dead ends: 1437 [2020-01-16 18:09:37,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-01-16 18:09:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-01-16 18:09:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3147 transitions. [2020-01-16 18:09:37,201 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3147 transitions. Word has length 25 [2020-01-16 18:09:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:37,201 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3147 transitions. [2020-01-16 18:09:37,201 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3147 transitions. [2020-01-16 18:09:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:37,202 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:37,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:37,203 INFO L426 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 999324493, now seen corresponding path program 644 times [2020-01-16 18:09:37,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:37,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891639557] [2020-01-16 18:09:37,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:37,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-01-16 18:09:37,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891639557] [2020-01-16 18:09:37,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:37,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:37,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362236098] [2020-01-16 18:09:37,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:37,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:37,672 INFO L87 Difference]: Start difference. First operand 797 states and 3147 transitions. Second operand 10 states. [2020-01-16 18:09:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:37,834 INFO L93 Difference]: Finished difference Result 1453 states and 5026 transitions. [2020-01-16 18:09:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:37,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:37,838 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:09:37,839 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:09:37,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:09:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 794. [2020-01-16 18:09:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3139 transitions. [2020-01-16 18:09:37,860 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3139 transitions. Word has length 25 [2020-01-16 18:09:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:37,861 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3139 transitions. [2020-01-16 18:09:37,861 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3139 transitions. [2020-01-16 18:09:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:37,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:37,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:37,862 INFO L426 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:37,862 INFO L82 PathProgramCache]: Analyzing trace with hash 482475123, now seen corresponding path program 645 times [2020-01-16 18:09:37,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:37,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764066948] [2020-01-16 18:09:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:38,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764066948] [2020-01-16 18:09:38,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:38,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:38,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187231353] [2020-01-16 18:09:38,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:38,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:38,320 INFO L87 Difference]: Start difference. First operand 794 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:09:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:38,467 INFO L93 Difference]: Finished difference Result 1452 states and 5023 transitions. [2020-01-16 18:09:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:38,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:38,471 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:09:38,471 INFO L226 Difference]: Without dead ends: 1440 [2020-01-16 18:09:38,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-01-16 18:09:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 798. [2020-01-16 18:09:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-01-16 18:09:38,493 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-01-16 18:09:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:38,493 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-01-16 18:09:38,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-01-16 18:09:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:38,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:38,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:38,494 INFO L426 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1020330701, now seen corresponding path program 646 times [2020-01-16 18:09:38,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081790829] [2020-01-16 18:09:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:38,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081790829] [2020-01-16 18:09:38,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:38,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:38,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649110501] [2020-01-16 18:09:38,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:38,957 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-01-16 18:09:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:39,099 INFO L93 Difference]: Finished difference Result 1458 states and 5031 transitions. [2020-01-16 18:09:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:39,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:39,103 INFO L225 Difference]: With dead ends: 1458 [2020-01-16 18:09:39,103 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:09:39,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:09:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 794. [2020-01-16 18:09:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3135 transitions. [2020-01-16 18:09:39,126 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3135 transitions. Word has length 25 [2020-01-16 18:09:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:39,126 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3135 transitions. [2020-01-16 18:09:39,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3135 transitions. [2020-01-16 18:09:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:39,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:39,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:39,127 INFO L426 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash 492978227, now seen corresponding path program 647 times [2020-01-16 18:09:39,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:39,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450587570] [2020-01-16 18:09:39,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450587570] [2020-01-16 18:09:39,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:39,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:39,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350015308] [2020-01-16 18:09:39,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:39,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:39,607 INFO L87 Difference]: Start difference. First operand 794 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:09:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:39,780 INFO L93 Difference]: Finished difference Result 1465 states and 5048 transitions. [2020-01-16 18:09:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:39,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:39,785 INFO L225 Difference]: With dead ends: 1465 [2020-01-16 18:09:39,785 INFO L226 Difference]: Without dead ends: 1449 [2020-01-16 18:09:39,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-01-16 18:09:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 803. [2020-01-16 18:09:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:09:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3151 transitions. [2020-01-16 18:09:39,807 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3151 transitions. Word has length 25 [2020-01-16 18:09:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:39,807 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3151 transitions. [2020-01-16 18:09:39,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3151 transitions. [2020-01-16 18:09:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:39,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:39,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:39,809 INFO L426 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -580107153, now seen corresponding path program 648 times [2020-01-16 18:09:39,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:39,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576284644] [2020-01-16 18:09:39,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:40,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576284644] [2020-01-16 18:09:40,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:40,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:40,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232830822] [2020-01-16 18:09:40,278 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:40,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:40,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:40,278 INFO L87 Difference]: Start difference. First operand 803 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:09:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:40,407 INFO L93 Difference]: Finished difference Result 1467 states and 5044 transitions. [2020-01-16 18:09:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:40,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:40,410 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:09:40,411 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:09:40,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:09:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 783. [2020-01-16 18:09:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:09:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-01-16 18:09:40,432 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-01-16 18:09:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:40,432 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-01-16 18:09:40,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-01-16 18:09:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:40,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:40,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:40,433 INFO L426 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash -927302379, now seen corresponding path program 649 times [2020-01-16 18:09:40,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:40,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40008809] [2020-01-16 18:09:40,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:40,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-01-16 18:09:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40008809] [2020-01-16 18:09:40,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:40,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:40,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183917965] [2020-01-16 18:09:40,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:40,885 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:09:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:41,089 INFO L93 Difference]: Finished difference Result 1427 states and 4979 transitions. [2020-01-16 18:09:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:41,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:41,093 INFO L225 Difference]: With dead ends: 1427 [2020-01-16 18:09:41,093 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:09:41,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:09:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 793. [2020-01-16 18:09:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3144 transitions. [2020-01-16 18:09:41,115 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3144 transitions. Word has length 25 [2020-01-16 18:09:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:41,115 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3144 transitions. [2020-01-16 18:09:41,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3144 transitions. [2020-01-16 18:09:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:41,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:41,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:41,117 INFO L426 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 683638579, now seen corresponding path program 650 times [2020-01-16 18:09:41,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:41,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56089368] [2020-01-16 18:09:41,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:41,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-01-16 18:09:41,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56089368] [2020-01-16 18:09:41,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:41,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:41,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929935586] [2020-01-16 18:09:41,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:41,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:41,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:41,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:41,562 INFO L87 Difference]: Start difference. First operand 793 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:09:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:41,769 INFO L93 Difference]: Finished difference Result 1424 states and 4970 transitions. [2020-01-16 18:09:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:41,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:41,773 INFO L225 Difference]: With dead ends: 1424 [2020-01-16 18:09:41,773 INFO L226 Difference]: Without dead ends: 1409 [2020-01-16 18:09:41,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-01-16 18:09:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-01-16 18:09:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:09:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-01-16 18:09:41,796 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-01-16 18:09:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:41,796 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-01-16 18:09:41,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-01-16 18:09:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:41,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:41,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:41,797 INFO L426 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 166789209, now seen corresponding path program 651 times [2020-01-16 18:09:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:41,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174808961] [2020-01-16 18:09:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:42,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174808961] [2020-01-16 18:09:42,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:42,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:42,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576105843] [2020-01-16 18:09:42,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:42,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:42,247 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:09:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:42,414 INFO L93 Difference]: Finished difference Result 1431 states and 4986 transitions. [2020-01-16 18:09:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:42,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:42,419 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:09:42,419 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:09:42,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:09:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-01-16 18:09:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-01-16 18:09:42,441 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-01-16 18:09:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:42,441 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-01-16 18:09:42,441 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-01-16 18:09:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:42,442 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:42,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:42,442 INFO L426 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 704644787, now seen corresponding path program 652 times [2020-01-16 18:09:42,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:42,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198950444] [2020-01-16 18:09:42,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:42,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198950444] [2020-01-16 18:09:42,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:42,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:42,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831794979] [2020-01-16 18:09:42,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:42,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:42,880 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-01-16 18:09:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:43,094 INFO L93 Difference]: Finished difference Result 1430 states and 4979 transitions. [2020-01-16 18:09:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:43,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:43,098 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:09:43,098 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:09:43,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:09:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 790. [2020-01-16 18:09:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-01-16 18:09:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3133 transitions. [2020-01-16 18:09:43,121 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3133 transitions. Word has length 25 [2020-01-16 18:09:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:43,121 INFO L478 AbstractCegarLoop]: Abstraction has 790 states and 3133 transitions. [2020-01-16 18:09:43,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3133 transitions. [2020-01-16 18:09:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:43,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:43,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:43,122 INFO L426 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash 177292313, now seen corresponding path program 653 times [2020-01-16 18:09:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:43,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956558849] [2020-01-16 18:09:43,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:43,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956558849] [2020-01-16 18:09:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205697551] [2020-01-16 18:09:43,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:43,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:43,564 INFO L87 Difference]: Start difference. First operand 790 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:09:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:43,765 INFO L93 Difference]: Finished difference Result 1423 states and 4965 transitions. [2020-01-16 18:09:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:43,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:43,769 INFO L225 Difference]: With dead ends: 1423 [2020-01-16 18:09:43,769 INFO L226 Difference]: Without dead ends: 1411 [2020-01-16 18:09:43,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-01-16 18:09:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 793. [2020-01-16 18:09:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-01-16 18:09:43,792 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-01-16 18:09:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:43,792 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-01-16 18:09:43,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-01-16 18:09:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:43,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:43,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:43,793 INFO L426 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash -895793067, now seen corresponding path program 654 times [2020-01-16 18:09:43,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:43,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246671551] [2020-01-16 18:09:43,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:44,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246671551] [2020-01-16 18:09:44,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:44,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:44,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572103436] [2020-01-16 18:09:44,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:44,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:44,240 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:09:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:44,428 INFO L93 Difference]: Finished difference Result 1425 states and 4966 transitions. [2020-01-16 18:09:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:44,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:44,432 INFO L225 Difference]: With dead ends: 1425 [2020-01-16 18:09:44,432 INFO L226 Difference]: Without dead ends: 1405 [2020-01-16 18:09:44,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-01-16 18:09:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 787. [2020-01-16 18:09:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:09:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3125 transitions. [2020-01-16 18:09:44,454 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3125 transitions. Word has length 25 [2020-01-16 18:09:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:44,454 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3125 transitions. [2020-01-16 18:09:44,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3125 transitions. [2020-01-16 18:09:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:44,455 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:44,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:44,456 INFO L426 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash 998731699, now seen corresponding path program 655 times [2020-01-16 18:09:44,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:44,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151075619] [2020-01-16 18:09:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:44,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151075619] [2020-01-16 18:09:44,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:44,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:44,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993631593] [2020-01-16 18:09:44,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:44,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:44,920 INFO L87 Difference]: Start difference. First operand 787 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:09:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:45,122 INFO L93 Difference]: Finished difference Result 1435 states and 4993 transitions. [2020-01-16 18:09:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:45,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:45,126 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:09:45,126 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:09:45,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:09:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-01-16 18:09:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3144 transitions. [2020-01-16 18:09:45,149 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3144 transitions. Word has length 25 [2020-01-16 18:09:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:45,149 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3144 transitions. [2020-01-16 18:09:45,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3144 transitions. [2020-01-16 18:09:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:45,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:45,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] [2020-01-16 18:09:45,151 INFO L426 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294639, now seen corresponding path program 656 times [2020-01-16 18:09:45,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:45,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431648119] [2020-01-16 18:09:45,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:45,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-01-16 18:09:45,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431648119] [2020-01-16 18:09:45,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:45,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:45,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160646613] [2020-01-16 18:09:45,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:45,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:45,608 INFO L87 Difference]: Start difference. First operand 794 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:09:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:45,771 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-01-16 18:09:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:45,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:45,775 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:09:45,775 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:09:45,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:09:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-01-16 18:09:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-01-16 18:09:45,798 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-01-16 18:09:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:45,798 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-01-16 18:09:45,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-01-16 18:09:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:45,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:45,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:45,799 INFO L426 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash 492385433, now seen corresponding path program 657 times [2020-01-16 18:09:45,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:45,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943929952] [2020-01-16 18:09:45,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943929952] [2020-01-16 18:09:46,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:46,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:46,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169114474] [2020-01-16 18:09:46,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:46,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:46,249 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:09:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:46,440 INFO L93 Difference]: Finished difference Result 1445 states and 5012 transitions. [2020-01-16 18:09:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:46,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:46,444 INFO L225 Difference]: With dead ends: 1445 [2020-01-16 18:09:46,444 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:09:46,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:09:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-01-16 18:09:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3149 transitions. [2020-01-16 18:09:46,466 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3149 transitions. Word has length 25 [2020-01-16 18:09:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:46,466 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3149 transitions. [2020-01-16 18:09:46,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3149 transitions. [2020-01-16 18:09:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:46,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:46,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:46,467 INFO L426 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1653785327, now seen corresponding path program 658 times [2020-01-16 18:09:46,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:46,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203723446] [2020-01-16 18:09:46,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:46,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203723446] [2020-01-16 18:09:46,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:46,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:46,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684795874] [2020-01-16 18:09:46,923 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:46,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:46,924 INFO L87 Difference]: Start difference. First operand 798 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:09:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:47,059 INFO L93 Difference]: Finished difference Result 1448 states and 5011 transitions. [2020-01-16 18:09:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:47,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:47,063 INFO L225 Difference]: With dead ends: 1448 [2020-01-16 18:09:47,063 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:09:47,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:09:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 791. [2020-01-16 18:09:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3132 transitions. [2020-01-16 18:09:47,085 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3132 transitions. Word has length 25 [2020-01-16 18:09:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:47,085 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3132 transitions. [2020-01-16 18:09:47,086 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3132 transitions. [2020-01-16 18:09:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:47,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:47,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:47,087 INFO L426 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash 502888537, now seen corresponding path program 659 times [2020-01-16 18:09:47,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:47,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824724094] [2020-01-16 18:09:47,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:47,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824724094] [2020-01-16 18:09:47,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:47,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:47,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121348645] [2020-01-16 18:09:47,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:47,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:47,537 INFO L87 Difference]: Start difference. First operand 791 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:09:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:47,716 INFO L93 Difference]: Finished difference Result 1436 states and 4987 transitions. [2020-01-16 18:09:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:47,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:47,720 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:09:47,721 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:09:47,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:09:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 795. [2020-01-16 18:09:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3139 transitions. [2020-01-16 18:09:47,743 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3139 transitions. Word has length 25 [2020-01-16 18:09:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:47,743 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3139 transitions. [2020-01-16 18:09:47,743 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3139 transitions. [2020-01-16 18:09:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:47,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:47,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:47,744 INFO L426 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1040744115, now seen corresponding path program 660 times [2020-01-16 18:09:47,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:47,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941388968] [2020-01-16 18:09:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:48,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-01-16 18:09:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941388968] [2020-01-16 18:09:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:48,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500640616] [2020-01-16 18:09:48,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:48,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:48,206 INFO L87 Difference]: Start difference. First operand 795 states and 3139 transitions. Second operand 10 states. [2020-01-16 18:09:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:48,338 INFO L93 Difference]: Finished difference Result 1442 states and 4995 transitions. [2020-01-16 18:09:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:48,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:48,342 INFO L225 Difference]: With dead ends: 1442 [2020-01-16 18:09:48,342 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:09:48,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:09:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 787. [2020-01-16 18:09:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:09:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3121 transitions. [2020-01-16 18:09:48,364 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3121 transitions. Word has length 25 [2020-01-16 18:09:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:48,364 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3121 transitions. [2020-01-16 18:09:48,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3121 transitions. [2020-01-16 18:09:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:48,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:48,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:48,365 INFO L426 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1649924147, now seen corresponding path program 661 times [2020-01-16 18:09:48,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:48,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580688209] [2020-01-16 18:09:48,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:48,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580688209] [2020-01-16 18:09:48,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:48,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:48,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096576578] [2020-01-16 18:09:48,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:48,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:48,819 INFO L87 Difference]: Start difference. First operand 787 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:09:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:49,024 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-01-16 18:09:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:49,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:49,028 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:09:49,028 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:09:49,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:09:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-01-16 18:09:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:09:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3152 transitions. [2020-01-16 18:09:49,050 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3152 transitions. Word has length 25 [2020-01-16 18:09:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:49,050 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3152 transitions. [2020-01-16 18:09:49,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3152 transitions. [2020-01-16 18:09:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:49,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:49,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:49,052 INFO L426 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2107187571, now seen corresponding path program 662 times [2020-01-16 18:09:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:49,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854342629] [2020-01-16 18:09:49,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:49,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854342629] [2020-01-16 18:09:49,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:49,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:49,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407793831] [2020-01-16 18:09:49,505 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:49,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:49,505 INFO L87 Difference]: Start difference. First operand 798 states and 3152 transitions. Second operand 10 states. [2020-01-16 18:09:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:49,688 INFO L93 Difference]: Finished difference Result 1446 states and 5016 transitions. [2020-01-16 18:09:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:49,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:49,692 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:09:49,692 INFO L226 Difference]: Without dead ends: 1427 [2020-01-16 18:09:49,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-01-16 18:09:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-01-16 18:09:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-01-16 18:09:49,713 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-01-16 18:09:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:49,714 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-01-16 18:09:49,714 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-01-16 18:09:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:49,715 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:49,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:49,715 INFO L426 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 49486293, now seen corresponding path program 663 times [2020-01-16 18:09:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280371521] [2020-01-16 18:09:49,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:50,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280371521] [2020-01-16 18:09:50,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:50,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:50,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507249899] [2020-01-16 18:09:50,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:50,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:50,178 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:09:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:50,385 INFO L93 Difference]: Finished difference Result 1453 states and 5030 transitions. [2020-01-16 18:09:50,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:50,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:50,389 INFO L225 Difference]: With dead ends: 1453 [2020-01-16 18:09:50,389 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:09:50,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:09:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 800. [2020-01-16 18:09:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:09:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3151 transitions. [2020-01-16 18:09:50,412 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3151 transitions. Word has length 25 [2020-01-16 18:09:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:50,412 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3151 transitions. [2020-01-16 18:09:50,412 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3151 transitions. [2020-01-16 18:09:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:50,413 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:50,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:50,413 INFO L426 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2096684467, now seen corresponding path program 664 times [2020-01-16 18:09:50,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:50,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29701664] [2020-01-16 18:09:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:50,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29701664] [2020-01-16 18:09:50,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:50,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:50,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480903270] [2020-01-16 18:09:50,875 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:50,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:50,876 INFO L87 Difference]: Start difference. First operand 800 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:09:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:51,007 INFO L93 Difference]: Finished difference Result 1456 states and 5029 transitions. [2020-01-16 18:09:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:51,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:51,011 INFO L225 Difference]: With dead ends: 1456 [2020-01-16 18:09:51,011 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:09:51,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:09:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 793. [2020-01-16 18:09:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:09:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3132 transitions. [2020-01-16 18:09:51,033 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3132 transitions. Word has length 25 [2020-01-16 18:09:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:51,033 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3132 transitions. [2020-01-16 18:09:51,033 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3132 transitions. [2020-01-16 18:09:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:51,034 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:51,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:51,034 INFO L426 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 80995605, now seen corresponding path program 665 times [2020-01-16 18:09:51,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:51,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85578012] [2020-01-16 18:09:51,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:51,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85578012] [2020-01-16 18:09:51,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536644530] [2020-01-16 18:09:51,486 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:51,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:51,487 INFO L87 Difference]: Start difference. First operand 793 states and 3132 transitions. Second operand 10 states. [2020-01-16 18:09:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:51,667 INFO L93 Difference]: Finished difference Result 1450 states and 5017 transitions. [2020-01-16 18:09:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:51,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:51,671 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:09:51,671 INFO L226 Difference]: Without dead ends: 1436 [2020-01-16 18:09:51,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-01-16 18:09:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-01-16 18:09:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:09:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3143 transitions. [2020-01-16 18:09:51,693 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3143 transitions. Word has length 25 [2020-01-16 18:09:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:51,693 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3143 transitions. [2020-01-16 18:09:51,694 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3143 transitions. [2020-01-16 18:09:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:51,695 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:51,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] [2020-01-16 18:09:51,695 INFO L426 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:51,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1691936563, now seen corresponding path program 666 times [2020-01-16 18:09:51,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:51,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868632445] [2020-01-16 18:09:51,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:52,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868632445] [2020-01-16 18:09:52,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:52,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:52,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029900592] [2020-01-16 18:09:52,168 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:52,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:52,168 INFO L87 Difference]: Start difference. First operand 799 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:09:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:52,310 INFO L93 Difference]: Finished difference Result 1454 states and 5019 transitions. [2020-01-16 18:09:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:52,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:52,314 INFO L225 Difference]: With dead ends: 1454 [2020-01-16 18:09:52,314 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:09:52,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:09:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 787. [2020-01-16 18:09:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:09:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3117 transitions. [2020-01-16 18:09:52,336 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3117 transitions. Word has length 25 [2020-01-16 18:09:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:52,336 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3117 transitions. [2020-01-16 18:09:52,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3117 transitions. [2020-01-16 18:09:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:52,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:52,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] [2020-01-16 18:09:52,337 INFO L426 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash -708505967, now seen corresponding path program 667 times [2020-01-16 18:09:52,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:52,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421782469] [2020-01-16 18:09:52,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421782469] [2020-01-16 18:09:52,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:52,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:52,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044392126] [2020-01-16 18:09:52,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:52,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:52,777 INFO L87 Difference]: Start difference. First operand 787 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:09:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:52,936 INFO L93 Difference]: Finished difference Result 1429 states and 4972 transitions. [2020-01-16 18:09:52,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:52,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:52,941 INFO L225 Difference]: With dead ends: 1429 [2020-01-16 18:09:52,941 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:09:52,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:09:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-01-16 18:09:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:09:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-01-16 18:09:52,963 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-01-16 18:09:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:52,963 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-01-16 18:09:52,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-01-16 18:09:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:52,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:52,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] [2020-01-16 18:09:52,964 INFO L426 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:52,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1781591347, now seen corresponding path program 668 times [2020-01-16 18:09:52,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:52,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211892203] [2020-01-16 18:09:52,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:53,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211892203] [2020-01-16 18:09:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:53,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:53,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096802082] [2020-01-16 18:09:53,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:53,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:53,414 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:09:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:53,615 INFO L93 Difference]: Finished difference Result 1431 states and 4973 transitions. [2020-01-16 18:09:53,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:53,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:53,619 INFO L225 Difference]: With dead ends: 1431 [2020-01-16 18:09:53,619 INFO L226 Difference]: Without dead ends: 1414 [2020-01-16 18:09:53,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-01-16 18:09:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-01-16 18:09:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-01-16 18:09:53,641 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-01-16 18:09:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:53,641 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-01-16 18:09:53,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-01-16 18:09:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:53,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:53,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:53,643 INFO L426 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1986023475, now seen corresponding path program 669 times [2020-01-16 18:09:53,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:53,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765123862] [2020-01-16 18:09:53,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:54,086 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-01-16 18:09:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:54,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765123862] [2020-01-16 18:09:54,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:54,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:54,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421814717] [2020-01-16 18:09:54,091 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:54,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:54,092 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:09:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:54,290 INFO L93 Difference]: Finished difference Result 1434 states and 4978 transitions. [2020-01-16 18:09:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:54,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:54,295 INFO L225 Difference]: With dead ends: 1434 [2020-01-16 18:09:54,295 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:09:54,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:09:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-01-16 18:09:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:09:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3135 transitions. [2020-01-16 18:09:54,317 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3135 transitions. Word has length 25 [2020-01-16 18:09:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:54,317 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3135 transitions. [2020-01-16 18:09:54,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3135 transitions. [2020-01-16 18:09:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:54,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:54,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:54,318 INFO L426 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1771088243, now seen corresponding path program 670 times [2020-01-16 18:09:54,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:54,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657694470] [2020-01-16 18:09:54,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:54,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657694470] [2020-01-16 18:09:54,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:54,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:54,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445775728] [2020-01-16 18:09:54,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:54,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:54,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:54,763 INFO L87 Difference]: Start difference. First operand 795 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:09:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:54,872 INFO L93 Difference]: Finished difference Result 1440 states and 4986 transitions. [2020-01-16 18:09:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:54,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:54,876 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:09:54,877 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:09:54,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:09:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-01-16 18:09:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:09:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3124 transitions. [2020-01-16 18:09:54,900 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3124 transitions. Word has length 25 [2020-01-16 18:09:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:54,900 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3124 transitions. [2020-01-16 18:09:54,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3124 transitions. [2020-01-16 18:09:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:54,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:54,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:54,902 INFO L426 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2007029683, now seen corresponding path program 671 times [2020-01-16 18:09:54,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:54,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129750178] [2020-01-16 18:09:54,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:55,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129750178] [2020-01-16 18:09:55,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:55,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:55,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967427579] [2020-01-16 18:09:55,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:55,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:55,345 INFO L87 Difference]: Start difference. First operand 791 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:09:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:55,509 INFO L93 Difference]: Finished difference Result 1440 states and 4988 transitions. [2020-01-16 18:09:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:55,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:55,514 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:09:55,514 INFO L226 Difference]: Without dead ends: 1426 [2020-01-16 18:09:55,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-01-16 18:09:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 797. [2020-01-16 18:09:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3135 transitions. [2020-01-16 18:09:55,536 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3135 transitions. Word has length 25 [2020-01-16 18:09:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:55,536 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3135 transitions. [2020-01-16 18:09:55,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3135 transitions. [2020-01-16 18:09:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:55,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:55,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:55,537 INFO L426 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash -676996655, now seen corresponding path program 672 times [2020-01-16 18:09:55,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:55,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156791136] [2020-01-16 18:09:55,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:55,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-01-16 18:09:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156791136] [2020-01-16 18:09:55,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:55,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:55,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197380795] [2020-01-16 18:09:55,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:55,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:55,991 INFO L87 Difference]: Start difference. First operand 797 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:09:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:56,113 INFO L93 Difference]: Finished difference Result 1444 states and 4990 transitions. [2020-01-16 18:09:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:56,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:56,118 INFO L225 Difference]: With dead ends: 1444 [2020-01-16 18:09:56,118 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:09:56,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:09:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 783. [2020-01-16 18:09:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:09:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3106 transitions. [2020-01-16 18:09:56,140 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3106 transitions. Word has length 25 [2020-01-16 18:09:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:56,141 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3106 transitions. [2020-01-16 18:09:56,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3106 transitions. [2020-01-16 18:09:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:56,142 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:56,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:56,142 INFO L426 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1024191881, now seen corresponding path program 673 times [2020-01-16 18:09:56,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:56,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416201997] [2020-01-16 18:09:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:56,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416201997] [2020-01-16 18:09:56,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:56,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:56,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612395221] [2020-01-16 18:09:56,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:56,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:56,606 INFO L87 Difference]: Start difference. First operand 783 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:09:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:56,753 INFO L93 Difference]: Finished difference Result 1474 states and 5108 transitions. [2020-01-16 18:09:56,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:56,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:56,757 INFO L225 Difference]: With dead ends: 1474 [2020-01-16 18:09:56,757 INFO L226 Difference]: Without dead ends: 1459 [2020-01-16 18:09:56,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-01-16 18:09:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 803. [2020-01-16 18:09:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:09:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3170 transitions. [2020-01-16 18:09:56,780 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3170 transitions. Word has length 25 [2020-01-16 18:09:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:56,780 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3170 transitions. [2020-01-16 18:09:56,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3170 transitions. [2020-01-16 18:09:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:56,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:56,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:56,781 INFO L426 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2097277261, now seen corresponding path program 674 times [2020-01-16 18:09:56,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:56,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080741388] [2020-01-16 18:09:56,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:57,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080741388] [2020-01-16 18:09:57,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:57,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:57,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075064577] [2020-01-16 18:09:57,239 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:57,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:57,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:57,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:57,239 INFO L87 Difference]: Start difference. First operand 803 states and 3170 transitions. Second operand 10 states. [2020-01-16 18:09:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:57,381 INFO L93 Difference]: Finished difference Result 1475 states and 5104 transitions. [2020-01-16 18:09:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:57,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:57,385 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:09:57,385 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:09:57,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:09:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 797. [2020-01-16 18:09:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-01-16 18:09:57,408 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-01-16 18:09:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:57,408 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-01-16 18:09:57,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-01-16 18:09:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:57,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:57,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:57,409 INFO L426 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1670337561, now seen corresponding path program 675 times [2020-01-16 18:09:57,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:57,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909894523] [2020-01-16 18:09:57,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:57,875 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:09:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:57,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909894523] [2020-01-16 18:09:57,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:57,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:57,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313430113] [2020-01-16 18:09:57,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:57,882 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:09:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:58,035 INFO L93 Difference]: Finished difference Result 1471 states and 5096 transitions. [2020-01-16 18:09:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:58,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:58,039 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:09:58,039 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:09:58,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:09:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 802. [2020-01-16 18:09:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:09:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3163 transitions. [2020-01-16 18:09:58,061 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3163 transitions. Word has length 25 [2020-01-16 18:09:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:58,062 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3163 transitions. [2020-01-16 18:09:58,062 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3163 transitions. [2020-01-16 18:09:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:58,063 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:58,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:09:58,063 INFO L426 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2086774157, now seen corresponding path program 676 times [2020-01-16 18:09:58,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:58,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647790961] [2020-01-16 18:09:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:58,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-01-16 18:09:58,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647790961] [2020-01-16 18:09:58,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:58,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:58,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24868105] [2020-01-16 18:09:58,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:58,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:58,523 INFO L87 Difference]: Start difference. First operand 802 states and 3163 transitions. Second operand 10 states. [2020-01-16 18:09:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:58,691 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-01-16 18:09:58,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:58,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:58,695 INFO L225 Difference]: With dead ends: 1470 [2020-01-16 18:09:58,696 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:09:58,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:09:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 797. [2020-01-16 18:09:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:09:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3149 transitions. [2020-01-16 18:09:58,720 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3149 transitions. Word has length 25 [2020-01-16 18:09:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:58,720 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3149 transitions. [2020-01-16 18:09:58,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3149 transitions. [2020-01-16 18:09:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:58,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:58,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] [2020-01-16 18:09:58,721 INFO L426 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1691343769, now seen corresponding path program 677 times [2020-01-16 18:09:58,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:58,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194295313] [2020-01-16 18:09:58,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:59,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194295313] [2020-01-16 18:09:59,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:59,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:59,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140584093] [2020-01-16 18:09:59,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:59,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:59,180 INFO L87 Difference]: Start difference. First operand 797 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:09:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:59,322 INFO L93 Difference]: Finished difference Result 1473 states and 5095 transitions. [2020-01-16 18:09:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:59,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:59,326 INFO L225 Difference]: With dead ends: 1473 [2020-01-16 18:09:59,326 INFO L226 Difference]: Without dead ends: 1457 [2020-01-16 18:09:59,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-01-16 18:09:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 802. [2020-01-16 18:09:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:09:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3158 transitions. [2020-01-16 18:09:59,348 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3158 transitions. Word has length 25 [2020-01-16 18:09:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:09:59,348 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3158 transitions. [2020-01-16 18:09:59,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:09:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3158 transitions. [2020-01-16 18:09:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:09:59,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:09:59,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] [2020-01-16 18:09:59,349 INFO L426 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:09:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:09:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -992682569, now seen corresponding path program 678 times [2020-01-16 18:09:59,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:09:59,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190770693] [2020-01-16 18:09:59,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:09:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:09:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:09:59,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190770693] [2020-01-16 18:09:59,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:09:59,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:09:59,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361823963] [2020-01-16 18:09:59,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:09:59,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:09:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:09:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:09:59,835 INFO L87 Difference]: Start difference. First operand 802 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:09:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:09:59,979 INFO L93 Difference]: Finished difference Result 1471 states and 5086 transitions. [2020-01-16 18:09:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:09:59,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:09:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:09:59,983 INFO L225 Difference]: With dead ends: 1471 [2020-01-16 18:09:59,983 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:09:59,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:09:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:10:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 792. [2020-01-16 18:10:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:10:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3135 transitions. [2020-01-16 18:10:00,005 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3135 transitions. Word has length 25 [2020-01-16 18:10:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:00,006 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3135 transitions. [2020-01-16 18:10:00,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3135 transitions. [2020-01-16 18:10:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:00,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:00,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:00,007 INFO L426 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 901842197, now seen corresponding path program 679 times [2020-01-16 18:10:00,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:00,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284228048] [2020-01-16 18:10:00,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:00,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-01-16 18:10:00,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284228048] [2020-01-16 18:10:00,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:00,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:00,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760585452] [2020-01-16 18:10:00,476 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:00,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:00,476 INFO L87 Difference]: Start difference. First operand 792 states and 3135 transitions. Second operand 10 states. [2020-01-16 18:10:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:00,643 INFO L93 Difference]: Finished difference Result 1488 states and 5134 transitions. [2020-01-16 18:10:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:00,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:00,647 INFO L225 Difference]: With dead ends: 1488 [2020-01-16 18:10:00,647 INFO L226 Difference]: Without dead ends: 1473 [2020-01-16 18:10:00,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-01-16 18:10:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 807. [2020-01-16 18:10:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-01-16 18:10:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3175 transitions. [2020-01-16 18:10:00,670 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3175 transitions. Word has length 25 [2020-01-16 18:10:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:00,670 INFO L478 AbstractCegarLoop]: Abstraction has 807 states and 3175 transitions. [2020-01-16 18:10:00,670 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3175 transitions. [2020-01-16 18:10:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:00,671 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:00,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:00,671 INFO L426 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:00,671 INFO L82 PathProgramCache]: Analyzing trace with hash -171243183, now seen corresponding path program 680 times [2020-01-16 18:10:00,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:00,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712894907] [2020-01-16 18:10:00,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:01,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712894907] [2020-01-16 18:10:01,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:01,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:01,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122534094] [2020-01-16 18:10:01,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:01,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:01,144 INFO L87 Difference]: Start difference. First operand 807 states and 3175 transitions. Second operand 10 states. [2020-01-16 18:10:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:01,283 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-01-16 18:10:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:01,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:01,287 INFO L225 Difference]: With dead ends: 1489 [2020-01-16 18:10:01,287 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:10:01,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:10:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 801. [2020-01-16 18:10:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:10:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3158 transitions. [2020-01-16 18:10:01,321 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3158 transitions. Word has length 25 [2020-01-16 18:10:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:01,321 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3158 transitions. [2020-01-16 18:10:01,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3158 transitions. [2020-01-16 18:10:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:01,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:01,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:01,322 INFO L426 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:01,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1995933785, now seen corresponding path program 681 times [2020-01-16 18:10:01,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:01,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783148992] [2020-01-16 18:10:01,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783148992] [2020-01-16 18:10:01,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:01,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:01,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140327817] [2020-01-16 18:10:01,792 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:01,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:01,792 INFO L87 Difference]: Start difference. First operand 801 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:10:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:01,938 INFO L93 Difference]: Finished difference Result 1491 states and 5133 transitions. [2020-01-16 18:10:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:01,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:01,946 INFO L225 Difference]: With dead ends: 1491 [2020-01-16 18:10:01,946 INFO L226 Difference]: Without dead ends: 1476 [2020-01-16 18:10:01,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-01-16 18:10:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 808. [2020-01-16 18:10:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:10:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3171 transitions. [2020-01-16 18:10:01,968 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3171 transitions. Word has length 25 [2020-01-16 18:10:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:01,968 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3171 transitions. [2020-01-16 18:10:01,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3171 transitions. [2020-01-16 18:10:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:01,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:01,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:01,969 INFO L426 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash -150236975, now seen corresponding path program 682 times [2020-01-16 18:10:01,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:01,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415828374] [2020-01-16 18:10:01,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10: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-01-16 18:10:02,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415828374] [2020-01-16 18:10:02,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:02,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:02,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406977602] [2020-01-16 18:10:02,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:02,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:02,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:02,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:02,470 INFO L87 Difference]: Start difference. First operand 808 states and 3171 transitions. Second operand 10 states. [2020-01-16 18:10:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:02,584 INFO L93 Difference]: Finished difference Result 1494 states and 5132 transitions. [2020-01-16 18:10:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:02,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:02,588 INFO L225 Difference]: With dead ends: 1494 [2020-01-16 18:10:02,588 INFO L226 Difference]: Without dead ends: 1469 [2020-01-16 18:10:02,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-01-16 18:10:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 801. [2020-01-16 18:10:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:10:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-01-16 18:10:02,610 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-01-16 18:10:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:02,610 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-01-16 18:10:02,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-01-16 18:10:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:02,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:02,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:02,612 INFO L426 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2016939993, now seen corresponding path program 683 times [2020-01-16 18:10:02,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:02,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710116920] [2020-01-16 18:10:02,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:03,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710116920] [2020-01-16 18:10:03,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:03,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:03,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838984724] [2020-01-16 18:10:03,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:03,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:03,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:03,096 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-01-16 18:10:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:03,237 INFO L93 Difference]: Finished difference Result 1495 states and 5134 transitions. [2020-01-16 18:10:03,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:03,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:03,242 INFO L225 Difference]: With dead ends: 1495 [2020-01-16 18:10:03,242 INFO L226 Difference]: Without dead ends: 1479 [2020-01-16 18:10:03,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2020-01-16 18:10:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 810. [2020-01-16 18:10:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-01-16 18:10:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-01-16 18:10:03,266 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-01-16 18:10:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:03,266 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-01-16 18:10:03,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-01-16 18:10:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:03,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:03,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:03,267 INFO L426 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 943854613, now seen corresponding path program 684 times [2020-01-16 18:10:03,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:03,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288301134] [2020-01-16 18:10:03,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:03,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288301134] [2020-01-16 18:10:03,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229770976] [2020-01-16 18:10:03,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:03,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:03,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:03,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:03,756 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-01-16 18:10:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:03,876 INFO L93 Difference]: Finished difference Result 1497 states and 5130 transitions. [2020-01-16 18:10:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:03,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:03,881 INFO L225 Difference]: With dead ends: 1497 [2020-01-16 18:10:03,881 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:10:03,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:10:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 792. [2020-01-16 18:10:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:10:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3127 transitions. [2020-01-16 18:10:03,903 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3127 transitions. Word has length 25 [2020-01-16 18:10:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:03,903 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3127 transitions. [2020-01-16 18:10:03,903 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3127 transitions. [2020-01-16 18:10:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:03,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:03,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:03,905 INFO L426 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1227438421, now seen corresponding path program 685 times [2020-01-16 18:10:03,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:03,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087404646] [2020-01-16 18:10:03,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:04,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087404646] [2020-01-16 18:10:04,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600930358] [2020-01-16 18:10:04,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:04,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:04,368 INFO L87 Difference]: Start difference. First operand 792 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:10:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:04,515 INFO L93 Difference]: Finished difference Result 1476 states and 5098 transitions. [2020-01-16 18:10:04,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:04,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:04,519 INFO L225 Difference]: With dead ends: 1476 [2020-01-16 18:10:04,519 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:10:04,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:10:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 803. [2020-01-16 18:10:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-01-16 18:10:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3158 transitions. [2020-01-16 18:10:04,551 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3158 transitions. Word has length 25 [2020-01-16 18:10:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:04,551 INFO L478 AbstractCegarLoop]: Abstraction has 803 states and 3158 transitions. [2020-01-16 18:10:04,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3158 transitions. [2020-01-16 18:10:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:04,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:04,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] [2020-01-16 18:10:04,553 INFO L426 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1765293999, now seen corresponding path program 686 times [2020-01-16 18:10:04,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:04,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408176439] [2020-01-16 18:10:04,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:05,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408176439] [2020-01-16 18:10:05,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:05,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:05,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240030494] [2020-01-16 18:10:05,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:05,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:05,028 INFO L87 Difference]: Start difference. First operand 803 states and 3158 transitions. Second operand 10 states. [2020-01-16 18:10:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:05,175 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-01-16 18:10:05,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:05,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:05,180 INFO L225 Difference]: With dead ends: 1475 [2020-01-16 18:10:05,180 INFO L226 Difference]: Without dead ends: 1456 [2020-01-16 18:10:05,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-01-16 18:10:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 798. [2020-01-16 18:10:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:10:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-01-16 18:10:05,203 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-01-16 18:10:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:05,203 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-01-16 18:10:05,203 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-01-16 18:10:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:05,204 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:05,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:05,204 INFO L426 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash -372999433, now seen corresponding path program 687 times [2020-01-16 18:10:05,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:05,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114286983] [2020-01-16 18:10:05,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:05,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-01-16 18:10:05,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114286983] [2020-01-16 18:10:05,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:05,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:05,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665885693] [2020-01-16 18:10:05,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:05,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:05,668 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:10:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:05,817 INFO L93 Difference]: Finished difference Result 1482 states and 5105 transitions. [2020-01-16 18:10:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:05,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:05,821 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:10:05,821 INFO L226 Difference]: Without dead ends: 1467 [2020-01-16 18:10:05,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-01-16 18:10:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 805. [2020-01-16 18:10:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:10:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3157 transitions. [2020-01-16 18:10:05,844 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3157 transitions. Word has length 25 [2020-01-16 18:10:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:05,844 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3157 transitions. [2020-01-16 18:10:05,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3157 transitions. [2020-01-16 18:10:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:05,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:05,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] [2020-01-16 18:10:05,845 INFO L426 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1775797103, now seen corresponding path program 688 times [2020-01-16 18:10:05,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:05,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393344498] [2020-01-16 18:10:05,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:06,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-01-16 18:10:06,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393344498] [2020-01-16 18:10:06,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:06,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:06,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130052885] [2020-01-16 18:10:06,325 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:06,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:06,326 INFO L87 Difference]: Start difference. First operand 805 states and 3157 transitions. Second operand 10 states. [2020-01-16 18:10:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:06,441 INFO L93 Difference]: Finished difference Result 1485 states and 5104 transitions. [2020-01-16 18:10:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:06,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:06,446 INFO L225 Difference]: With dead ends: 1485 [2020-01-16 18:10:06,446 INFO L226 Difference]: Without dead ends: 1460 [2020-01-16 18:10:06,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-01-16 18:10:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 798. [2020-01-16 18:10:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:10:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3138 transitions. [2020-01-16 18:10:06,469 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3138 transitions. Word has length 25 [2020-01-16 18:10:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:06,469 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3138 transitions. [2020-01-16 18:10:06,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3138 transitions. [2020-01-16 18:10:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:06,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:06,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] [2020-01-16 18:10:06,471 INFO L426 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash -341490121, now seen corresponding path program 689 times [2020-01-16 18:10:06,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:06,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142491631] [2020-01-16 18:10:06,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:06,939 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-01-16 18:10:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:06,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142491631] [2020-01-16 18:10:06,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:06,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:06,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942920870] [2020-01-16 18:10:06,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:06,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:06,946 INFO L87 Difference]: Start difference. First operand 798 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:10:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:07,093 INFO L93 Difference]: Finished difference Result 1479 states and 5092 transitions. [2020-01-16 18:10:07,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:07,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:07,096 INFO L225 Difference]: With dead ends: 1479 [2020-01-16 18:10:07,097 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:10:07,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:10:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 804. [2020-01-16 18:10:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:10:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3149 transitions. [2020-01-16 18:10:07,119 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3149 transitions. Word has length 25 [2020-01-16 18:10:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:07,119 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3149 transitions. [2020-01-16 18:10:07,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3149 transitions. [2020-01-16 18:10:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:07,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:07,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:07,120 INFO L426 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1269450837, now seen corresponding path program 690 times [2020-01-16 18:10:07,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:07,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257088955] [2020-01-16 18:10:07,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:07,590 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-01-16 18:10:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:07,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257088955] [2020-01-16 18:10:07,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:07,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:07,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441965471] [2020-01-16 18:10:07,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:07,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:07,597 INFO L87 Difference]: Start difference. First operand 804 states and 3149 transitions. Second operand 10 states. [2020-01-16 18:10:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:07,714 INFO L93 Difference]: Finished difference Result 1483 states and 5094 transitions. [2020-01-16 18:10:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:07,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:07,718 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:10:07,719 INFO L226 Difference]: Without dead ends: 1453 [2020-01-16 18:10:07,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-01-16 18:10:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-01-16 18:10:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:10:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3121 transitions. [2020-01-16 18:10:07,741 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3121 transitions. Word has length 25 [2020-01-16 18:10:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:07,741 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3121 transitions. [2020-01-16 18:10:07,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3121 transitions. [2020-01-16 18:10:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:07,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:07,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:07,742 INFO L426 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash 805545489, now seen corresponding path program 691 times [2020-01-16 18:10:07,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:07,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562056636] [2020-01-16 18:10:07,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:08,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562056636] [2020-01-16 18:10:08,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:08,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:08,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147693835] [2020-01-16 18:10:08,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:08,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:08,201 INFO L87 Difference]: Start difference. First operand 792 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:10:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:08,365 INFO L93 Difference]: Finished difference Result 1482 states and 5104 transitions. [2020-01-16 18:10:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:08,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:08,369 INFO L225 Difference]: With dead ends: 1482 [2020-01-16 18:10:08,369 INFO L226 Difference]: Without dead ends: 1466 [2020-01-16 18:10:08,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-01-16 18:10:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 804. [2020-01-16 18:10:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:10:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3154 transitions. [2020-01-16 18:10:08,391 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3154 transitions. Word has length 25 [2020-01-16 18:10:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:08,392 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3154 transitions. [2020-01-16 18:10:08,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3154 transitions. [2020-01-16 18:10:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:08,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:08,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] [2020-01-16 18:10:08,393 INFO L426 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1878480849, now seen corresponding path program 692 times [2020-01-16 18:10:08,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:08,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886337533] [2020-01-16 18:10:08,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:08,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886337533] [2020-01-16 18:10:08,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:08,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:08,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755532067] [2020-01-16 18:10:08,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:08,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:08,852 INFO L87 Difference]: Start difference. First operand 804 states and 3154 transitions. Second operand 10 states. [2020-01-16 18:10:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:09,010 INFO L93 Difference]: Finished difference Result 1480 states and 5095 transitions. [2020-01-16 18:10:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:09,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:09,014 INFO L225 Difference]: With dead ends: 1480 [2020-01-16 18:10:09,014 INFO L226 Difference]: Without dead ends: 1461 [2020-01-16 18:10:09,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-01-16 18:10:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 799. [2020-01-16 18:10:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:10:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3140 transitions. [2020-01-16 18:10:09,036 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3140 transitions. Word has length 25 [2020-01-16 18:10:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:09,036 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3140 transitions. [2020-01-16 18:10:09,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3140 transitions. [2020-01-16 18:10:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:09,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:09,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] [2020-01-16 18:10:09,037 INFO L426 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash -794892365, now seen corresponding path program 693 times [2020-01-16 18:10:09,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:09,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833039217] [2020-01-16 18:10:09,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:09,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833039217] [2020-01-16 18:10:09,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:09,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:09,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866874683] [2020-01-16 18:10:09,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:09,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:09,507 INFO L87 Difference]: Start difference. First operand 799 states and 3140 transitions. Second operand 10 states. [2020-01-16 18:10:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:09,681 INFO L93 Difference]: Finished difference Result 1490 states and 5115 transitions. [2020-01-16 18:10:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:09,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:09,686 INFO L225 Difference]: With dead ends: 1490 [2020-01-16 18:10:09,686 INFO L226 Difference]: Without dead ends: 1474 [2020-01-16 18:10:09,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-01-16 18:10:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 808. [2020-01-16 18:10:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-01-16 18:10:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3156 transitions. [2020-01-16 18:10:09,708 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3156 transitions. Word has length 25 [2020-01-16 18:10:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:09,709 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 3156 transitions. [2020-01-16 18:10:09,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3156 transitions. [2020-01-16 18:10:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:09,710 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:09,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:09,710 INFO L426 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1867977745, now seen corresponding path program 694 times [2020-01-16 18:10:09,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:09,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708428801] [2020-01-16 18:10:09,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:10,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708428801] [2020-01-16 18:10:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:10,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:10,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342168449] [2020-01-16 18:10:10,212 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:10,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:10,213 INFO L87 Difference]: Start difference. First operand 808 states and 3156 transitions. Second operand 10 states. [2020-01-16 18:10:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:10,340 INFO L93 Difference]: Finished difference Result 1492 states and 5111 transitions. [2020-01-16 18:10:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:10,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:10,345 INFO L225 Difference]: With dead ends: 1492 [2020-01-16 18:10:10,345 INFO L226 Difference]: Without dead ends: 1465 [2020-01-16 18:10:10,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-01-16 18:10:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 799. [2020-01-16 18:10:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-01-16 18:10:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3133 transitions. [2020-01-16 18:10:10,367 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3133 transitions. Word has length 25 [2020-01-16 18:10:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:10,367 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 3133 transitions. [2020-01-16 18:10:10,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3133 transitions. [2020-01-16 18:10:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:10,368 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:10,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:10,368 INFO L426 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash -784389261, now seen corresponding path program 695 times [2020-01-16 18:10:10,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:10,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518892491] [2020-01-16 18:10:10,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:10,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518892491] [2020-01-16 18:10:10,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:10,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:10,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507007942] [2020-01-16 18:10:10,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:10,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:10,839 INFO L87 Difference]: Start difference. First operand 799 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:10:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:10,986 INFO L93 Difference]: Finished difference Result 1483 states and 5093 transitions. [2020-01-16 18:10:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:10,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:10,991 INFO L225 Difference]: With dead ends: 1483 [2020-01-16 18:10:10,991 INFO L226 Difference]: Without dead ends: 1469 [2020-01-16 18:10:10,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-01-16 18:10:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 805. [2020-01-16 18:10:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-01-16 18:10:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3144 transitions. [2020-01-16 18:10:11,013 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3144 transitions. Word has length 25 [2020-01-16 18:10:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:11,013 INFO L478 AbstractCegarLoop]: Abstraction has 805 states and 3144 transitions. [2020-01-16 18:10:11,013 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3144 transitions. [2020-01-16 18:10:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:11,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:11,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:11,015 INFO L426 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash 826551697, now seen corresponding path program 696 times [2020-01-16 18:10:11,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456789153] [2020-01-16 18:10:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:11,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456789153] [2020-01-16 18:10:11,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:11,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:11,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025837396] [2020-01-16 18:10:11,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:11,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:11,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:11,494 INFO L87 Difference]: Start difference. First operand 805 states and 3144 transitions. Second operand 10 states. [2020-01-16 18:10:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:11,627 INFO L93 Difference]: Finished difference Result 1487 states and 5095 transitions. [2020-01-16 18:10:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:11,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:11,632 INFO L225 Difference]: With dead ends: 1487 [2020-01-16 18:10:11,632 INFO L226 Difference]: Without dead ends: 1447 [2020-01-16 18:10:11,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-01-16 18:10:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 783. [2020-01-16 18:10:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3099 transitions. [2020-01-16 18:10:11,654 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3099 transitions. Word has length 25 [2020-01-16 18:10:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:11,654 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3099 transitions. [2020-01-16 18:10:11,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3099 transitions. [2020-01-16 18:10:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:11,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:11,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:11,655 INFO L426 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 489859575, now seen corresponding path program 697 times [2020-01-16 18:10:11,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:11,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51350277] [2020-01-16 18:10:11,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:12,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51350277] [2020-01-16 18:10:12,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:12,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:12,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622165274] [2020-01-16 18:10:12,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:12,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:12,093 INFO L87 Difference]: Start difference. First operand 783 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:10:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:12,241 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-01-16 18:10:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:12,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:12,245 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:10:12,245 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:10:12,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:10:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-01-16 18:10:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:10:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-01-16 18:10:12,268 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-01-16 18:10:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:12,268 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-01-16 18:10:12,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-01-16 18:10:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:12,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:12,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:12,270 INFO L426 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2100800533, now seen corresponding path program 698 times [2020-01-16 18:10:12,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:12,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365394408] [2020-01-16 18:10:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:12,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365394408] [2020-01-16 18:10:12,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:12,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:12,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174500034] [2020-01-16 18:10:12,697 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:12,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:12,697 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-01-16 18:10:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:12,846 INFO L93 Difference]: Finished difference Result 1436 states and 4984 transitions. [2020-01-16 18:10:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:12,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:12,850 INFO L225 Difference]: With dead ends: 1436 [2020-01-16 18:10:12,850 INFO L226 Difference]: Without dead ends: 1417 [2020-01-16 18:10:12,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-01-16 18:10:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-01-16 18:10:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:10:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-01-16 18:10:12,885 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-01-16 18:10:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:12,885 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-01-16 18:10:12,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-01-16 18:10:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:12,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:12,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:12,886 INFO L426 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1110578279, now seen corresponding path program 699 times [2020-01-16 18:10:12,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:12,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265843498] [2020-01-16 18:10:12,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:13,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-01-16 18:10:13,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265843498] [2020-01-16 18:10:13,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:13,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:13,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058586213] [2020-01-16 18:10:13,325 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:13,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:13,325 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:10:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:13,482 INFO L93 Difference]: Finished difference Result 1430 states and 4972 transitions. [2020-01-16 18:10:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:13,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:13,486 INFO L225 Difference]: With dead ends: 1430 [2020-01-16 18:10:13,486 INFO L226 Difference]: Without dead ends: 1418 [2020-01-16 18:10:13,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-01-16 18:10:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-01-16 18:10:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-01-16 18:10:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-01-16 18:10:13,508 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-01-16 18:10:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:13,508 INFO L478 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-01-16 18:10:13,508 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-01-16 18:10:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:13,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:13,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:13,509 INFO L426 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2111303637, now seen corresponding path program 700 times [2020-01-16 18:10:13,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:13,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897516287] [2020-01-16 18:10:13,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:13,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897516287] [2020-01-16 18:10:13,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:13,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:13,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3750515] [2020-01-16 18:10:13,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:13,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:13,947 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-01-16 18:10:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:14,098 INFO L93 Difference]: Finished difference Result 1432 states and 4973 transitions. [2020-01-16 18:10:14,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:14,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:14,102 INFO L225 Difference]: With dead ends: 1432 [2020-01-16 18:10:14,103 INFO L226 Difference]: Without dead ends: 1415 [2020-01-16 18:10:14,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-01-16 18:10:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-01-16 18:10:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-01-16 18:10:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3125 transitions. [2020-01-16 18:10:14,125 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3125 transitions. Word has length 25 [2020-01-16 18:10:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:14,125 INFO L478 AbstractCegarLoop]: Abstraction has 791 states and 3125 transitions. [2020-01-16 18:10:14,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3125 transitions. [2020-01-16 18:10:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:14,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:14,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] [2020-01-16 18:10:14,126 INFO L426 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1100075175, now seen corresponding path program 701 times [2020-01-16 18:10:14,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:14,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440830493] [2020-01-16 18:10:14,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:14,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440830493] [2020-01-16 18:10:14,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:14,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:14,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490748674] [2020-01-16 18:10:14,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:14,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:14,575 INFO L87 Difference]: Start difference. First operand 791 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:10:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:14,717 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-01-16 18:10:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:14,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:14,721 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:10:14,721 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:10:14,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:10:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 796. [2020-01-16 18:10:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:10:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3134 transitions. [2020-01-16 18:10:14,744 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3134 transitions. Word has length 25 [2020-01-16 18:10:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:14,744 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3134 transitions. [2020-01-16 18:10:14,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3134 transitions. [2020-01-16 18:10:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:14,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:14,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:14,746 INFO L426 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash 510865783, now seen corresponding path program 702 times [2020-01-16 18:10:14,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:14,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511832574] [2020-01-16 18:10:14,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:15,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-01-16 18:10:15,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511832574] [2020-01-16 18:10:15,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:15,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:15,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804550822] [2020-01-16 18:10:15,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:15,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:15,190 INFO L87 Difference]: Start difference. First operand 796 states and 3134 transitions. Second operand 10 states. [2020-01-16 18:10:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:15,364 INFO L93 Difference]: Finished difference Result 1438 states and 4982 transitions. [2020-01-16 18:10:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:15,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:15,368 INFO L225 Difference]: With dead ends: 1438 [2020-01-16 18:10:15,368 INFO L226 Difference]: Without dead ends: 1416 [2020-01-16 18:10:15,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-01-16 18:10:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 788. [2020-01-16 18:10:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:10:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3117 transitions. [2020-01-16 18:10:15,390 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3117 transitions. Word has length 25 [2020-01-16 18:10:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:15,390 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3117 transitions. [2020-01-16 18:10:15,391 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3117 transitions. [2020-01-16 18:10:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:15,392 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:15,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:15,392 INFO L426 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1879073643, now seen corresponding path program 703 times [2020-01-16 18:10:15,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:15,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192840826] [2020-01-16 18:10:15,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:15,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192840826] [2020-01-16 18:10:15,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:15,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:15,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240540431] [2020-01-16 18:10:15,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:15,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:15,839 INFO L87 Difference]: Start difference. First operand 788 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:10:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:16,013 INFO L93 Difference]: Finished difference Result 1443 states and 4999 transitions. [2020-01-16 18:10:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:16,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:16,017 INFO L225 Difference]: With dead ends: 1443 [2020-01-16 18:10:16,017 INFO L226 Difference]: Without dead ends: 1431 [2020-01-16 18:10:16,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-01-16 18:10:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 796. [2020-01-16 18:10:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:10:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3138 transitions. [2020-01-16 18:10:16,039 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3138 transitions. Word has length 25 [2020-01-16 18:10:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:16,039 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3138 transitions. [2020-01-16 18:10:16,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3138 transitions. [2020-01-16 18:10:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:16,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:16,041 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:16,041 INFO L426 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -268132685, now seen corresponding path program 704 times [2020-01-16 18:10:16,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:16,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104419804] [2020-01-16 18:10:16,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:16,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-01-16 18:10:16,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104419804] [2020-01-16 18:10:16,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:16,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:16,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302986095] [2020-01-16 18:10:16,470 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:16,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:16,470 INFO L87 Difference]: Start difference. First operand 796 states and 3138 transitions. Second operand 10 states. [2020-01-16 18:10:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:16,617 INFO L93 Difference]: Finished difference Result 1447 states and 5004 transitions. [2020-01-16 18:10:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:16,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:16,621 INFO L225 Difference]: With dead ends: 1447 [2020-01-16 18:10:16,622 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:10:16,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:10:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-01-16 18:10:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:10:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-01-16 18:10:16,644 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-01-16 18:10:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:16,645 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-01-16 18:10:16,645 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-01-16 18:10:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:16,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:16,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:16,646 INFO L426 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash -784982055, now seen corresponding path program 705 times [2020-01-16 18:10:16,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:16,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710921104] [2020-01-16 18:10:16,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10: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-01-16 18:10:17,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710921104] [2020-01-16 18:10:17,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:17,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:17,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655228086] [2020-01-16 18:10:17,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:17,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:17,099 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:10:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:17,253 INFO L93 Difference]: Finished difference Result 1446 states and 5001 transitions. [2020-01-16 18:10:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:17,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:17,257 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:10:17,258 INFO L226 Difference]: Without dead ends: 1434 [2020-01-16 18:10:17,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-01-16 18:10:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-01-16 18:10:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-01-16 18:10:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3137 transitions. [2020-01-16 18:10:17,280 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3137 transitions. Word has length 25 [2020-01-16 18:10:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:17,280 INFO L478 AbstractCegarLoop]: Abstraction has 797 states and 3137 transitions. [2020-01-16 18:10:17,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3137 transitions. [2020-01-16 18:10:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:17,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:17,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:17,281 INFO L426 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash -247126477, now seen corresponding path program 706 times [2020-01-16 18:10:17,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:17,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841159135] [2020-01-16 18:10:17,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:17,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841159135] [2020-01-16 18:10:17,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:17,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:17,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019719064] [2020-01-16 18:10:17,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:17,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:17,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:17,724 INFO L87 Difference]: Start difference. First operand 797 states and 3137 transitions. Second operand 10 states. [2020-01-16 18:10:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:17,845 INFO L93 Difference]: Finished difference Result 1452 states and 5009 transitions. [2020-01-16 18:10:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:17,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:17,849 INFO L225 Difference]: With dead ends: 1452 [2020-01-16 18:10:17,849 INFO L226 Difference]: Without dead ends: 1430 [2020-01-16 18:10:17,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-01-16 18:10:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-01-16 18:10:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-01-16 18:10:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3126 transitions. [2020-01-16 18:10:17,873 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3126 transitions. Word has length 25 [2020-01-16 18:10:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:17,873 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 3126 transitions. [2020-01-16 18:10:17,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3126 transitions. [2020-01-16 18:10:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:17,874 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:17,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:17,874 INFO L426 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash -774478951, now seen corresponding path program 707 times [2020-01-16 18:10:17,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:17,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384259963] [2020-01-16 18:10:17,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:18,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384259963] [2020-01-16 18:10:18,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:18,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:18,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853993212] [2020-01-16 18:10:18,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:18,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:18,326 INFO L87 Difference]: Start difference. First operand 793 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:10:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:18,484 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-01-16 18:10:18,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:18,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:18,488 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:10:18,488 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:10:18,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:10:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2020-01-16 18:10:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-01-16 18:10:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3142 transitions. [2020-01-16 18:10:18,511 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3142 transitions. Word has length 25 [2020-01-16 18:10:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:18,511 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 3142 transitions. [2020-01-16 18:10:18,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3142 transitions. [2020-01-16 18:10:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:18,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:18,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:18,523 INFO L426 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1847564331, now seen corresponding path program 708 times [2020-01-16 18:10:18,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:18,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655980360] [2020-01-16 18:10:18,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:18,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655980360] [2020-01-16 18:10:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:18,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:18,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24399591] [2020-01-16 18:10:18,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:18,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:18,985 INFO L87 Difference]: Start difference. First operand 802 states and 3142 transitions. Second operand 10 states. [2020-01-16 18:10:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:19,107 INFO L93 Difference]: Finished difference Result 1461 states and 5022 transitions. [2020-01-16 18:10:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:19,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:19,111 INFO L225 Difference]: With dead ends: 1461 [2020-01-16 18:10:19,111 INFO L226 Difference]: Without dead ends: 1429 [2020-01-16 18:10:19,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-01-16 18:10:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 788. [2020-01-16 18:10:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:10:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3112 transitions. [2020-01-16 18:10:19,134 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3112 transitions. Word has length 25 [2020-01-16 18:10:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:19,134 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3112 transitions. [2020-01-16 18:10:19,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3112 transitions. [2020-01-16 18:10:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:19,135 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:19,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] [2020-01-16 18:10:19,135 INFO L426 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:19,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1553477419, now seen corresponding path program 709 times [2020-01-16 18:10:19,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:19,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625335940] [2020-01-16 18:10:19,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:19,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625335940] [2020-01-16 18:10:19,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:19,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:19,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249047003] [2020-01-16 18:10:19,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:19,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:19,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:19,585 INFO L87 Difference]: Start difference. First operand 788 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:10:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:19,762 INFO L93 Difference]: Finished difference Result 1435 states and 4977 transitions. [2020-01-16 18:10:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:19,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:19,765 INFO L225 Difference]: With dead ends: 1435 [2020-01-16 18:10:19,765 INFO L226 Difference]: Without dead ends: 1423 [2020-01-16 18:10:19,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-01-16 18:10:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 795. [2020-01-16 18:10:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:10:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3131 transitions. [2020-01-16 18:10:19,787 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3131 transitions. Word has length 25 [2020-01-16 18:10:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:19,787 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3131 transitions. [2020-01-16 18:10:19,787 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3131 transitions. [2020-01-16 18:10:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:19,788 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:19,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:19,789 INFO L426 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1668404497, now seen corresponding path program 710 times [2020-01-16 18:10:19,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:19,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032505375] [2020-01-16 18:10:19,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:20,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032505375] [2020-01-16 18:10:20,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:20,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:20,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251489482] [2020-01-16 18:10:20,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:20,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:20,242 INFO L87 Difference]: Start difference. First operand 795 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:10:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:20,398 INFO L93 Difference]: Finished difference Result 1437 states and 4978 transitions. [2020-01-16 18:10:20,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:20,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:20,402 INFO L225 Difference]: With dead ends: 1437 [2020-01-16 18:10:20,402 INFO L226 Difference]: Without dead ends: 1420 [2020-01-16 18:10:20,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-01-16 18:10:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 792. [2020-01-16 18:10:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:10:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3123 transitions. [2020-01-16 18:10:20,425 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3123 transitions. Word has length 25 [2020-01-16 18:10:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:20,426 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3123 transitions. [2020-01-16 18:10:20,426 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3123 transitions. [2020-01-16 18:10:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:20,427 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:20,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] [2020-01-16 18:10:20,427 INFO L426 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1141052023, now seen corresponding path program 711 times [2020-01-16 18:10:20,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:20,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671665938] [2020-01-16 18:10:20,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:20,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-01-16 18:10:20,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671665938] [2020-01-16 18:10:20,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:20,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:20,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045905197] [2020-01-16 18:10:20,870 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:20,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:20,871 INFO L87 Difference]: Start difference. First operand 792 states and 3123 transitions. Second operand 10 states. [2020-01-16 18:10:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:21,022 INFO L93 Difference]: Finished difference Result 1440 states and 4983 transitions. [2020-01-16 18:10:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:21,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:21,025 INFO L225 Difference]: With dead ends: 1440 [2020-01-16 18:10:21,025 INFO L226 Difference]: Without dead ends: 1428 [2020-01-16 18:10:21,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-01-16 18:10:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 796. [2020-01-16 18:10:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-01-16 18:10:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3130 transitions. [2020-01-16 18:10:21,047 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3130 transitions. Word has length 25 [2020-01-16 18:10:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:21,048 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 3130 transitions. [2020-01-16 18:10:21,048 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3130 transitions. [2020-01-16 18:10:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:21,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:21,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:21,049 INFO L426 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1678907601, now seen corresponding path program 712 times [2020-01-16 18:10:21,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:21,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999618438] [2020-01-16 18:10:21,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:21,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999618438] [2020-01-16 18:10:21,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:21,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:21,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575113786] [2020-01-16 18:10:21,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:21,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:21,497 INFO L87 Difference]: Start difference. First operand 796 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:10:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:21,617 INFO L93 Difference]: Finished difference Result 1446 states and 4991 transitions. [2020-01-16 18:10:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:21,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:21,622 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:10:21,622 INFO L226 Difference]: Without dead ends: 1424 [2020-01-16 18:10:21,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-01-16 18:10:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-01-16 18:10:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-01-16 18:10:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3119 transitions. [2020-01-16 18:10:21,654 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:21,654 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 3119 transitions. [2020-01-16 18:10:21,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3119 transitions. [2020-01-16 18:10:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:21,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:21,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:21,655 INFO L426 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:21,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1162058231, now seen corresponding path program 713 times [2020-01-16 18:10:21,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:21,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270083861] [2020-01-16 18:10:21,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:22,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270083861] [2020-01-16 18:10:22,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:22,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:22,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740977236] [2020-01-16 18:10:22,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:22,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:22,112 INFO L87 Difference]: Start difference. First operand 792 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:22,266 INFO L93 Difference]: Finished difference Result 1446 states and 4993 transitions. [2020-01-16 18:10:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:22,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:22,270 INFO L225 Difference]: With dead ends: 1446 [2020-01-16 18:10:22,271 INFO L226 Difference]: Without dead ends: 1432 [2020-01-16 18:10:22,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-01-16 18:10:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-01-16 18:10:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-01-16 18:10:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3130 transitions. [2020-01-16 18:10:22,294 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3130 transitions. Word has length 25 [2020-01-16 18:10:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:22,294 INFO L478 AbstractCegarLoop]: Abstraction has 798 states and 3130 transitions. [2020-01-16 18:10:22,294 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3130 transitions. [2020-01-16 18:10:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:22,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:22,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:22,295 INFO L426 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1521968107, now seen corresponding path program 714 times [2020-01-16 18:10:22,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:22,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153271502] [2020-01-16 18:10:22,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:22,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153271502] [2020-01-16 18:10:22,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:22,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:22,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735061401] [2020-01-16 18:10:22,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:22,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:22,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:22,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:22,756 INFO L87 Difference]: Start difference. First operand 798 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:10:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:22,884 INFO L93 Difference]: Finished difference Result 1450 states and 4995 transitions. [2020-01-16 18:10:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:22,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:22,888 INFO L225 Difference]: With dead ends: 1450 [2020-01-16 18:10:22,888 INFO L226 Difference]: Without dead ends: 1422 [2020-01-16 18:10:22,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-01-16 18:10:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 788. [2020-01-16 18:10:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-01-16 18:10:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3108 transitions. [2020-01-16 18:10:22,910 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3108 transitions. Word has length 25 [2020-01-16 18:10:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:22,910 INFO L478 AbstractCegarLoop]: Abstraction has 788 states and 3108 transitions. [2020-01-16 18:10:22,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3108 transitions. [2020-01-16 18:10:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:22,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:22,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:22,912 INFO L426 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash 383059763, now seen corresponding path program 715 times [2020-01-16 18:10:22,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:22,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43725060] [2020-01-16 18:10:22,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:23,367 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-01-16 18:10:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:23,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43725060] [2020-01-16 18:10:23,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:23,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:23,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344425926] [2020-01-16 18:10:23,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:23,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:23,374 INFO L87 Difference]: Start difference. First operand 788 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:10:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:23,519 INFO L93 Difference]: Finished difference Result 1459 states and 5032 transitions. [2020-01-16 18:10:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:23,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:23,523 INFO L225 Difference]: With dead ends: 1459 [2020-01-16 18:10:23,523 INFO L226 Difference]: Without dead ends: 1443 [2020-01-16 18:10:23,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-01-16 18:10:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 800. [2020-01-16 18:10:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-01-16 18:10:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-01-16 18:10:23,546 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-01-16 18:10:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:23,546 INFO L478 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-01-16 18:10:23,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-01-16 18:10:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:23,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:23,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:23,548 INFO L426 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1994000721, now seen corresponding path program 716 times [2020-01-16 18:10:23,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:23,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622242393] [2020-01-16 18:10:23,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:23,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622242393] [2020-01-16 18:10:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:23,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:23,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690591036] [2020-01-16 18:10:23,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:23,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:23,994 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-01-16 18:10:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:24,149 INFO L93 Difference]: Finished difference Result 1457 states and 5023 transitions. [2020-01-16 18:10:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:24,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:24,153 INFO L225 Difference]: With dead ends: 1457 [2020-01-16 18:10:24,153 INFO L226 Difference]: Without dead ends: 1438 [2020-01-16 18:10:24,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-01-16 18:10:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 795. [2020-01-16 18:10:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:10:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3127 transitions. [2020-01-16 18:10:24,176 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3127 transitions. Word has length 25 [2020-01-16 18:10:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:24,176 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3127 transitions. [2020-01-16 18:10:24,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3127 transitions. [2020-01-16 18:10:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:24,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:24,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:24,177 INFO L426 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1217378091, now seen corresponding path program 717 times [2020-01-16 18:10:24,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:24,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279652144] [2020-01-16 18:10:24,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:24,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279652144] [2020-01-16 18:10:24,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:24,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:24,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929537492] [2020-01-16 18:10:24,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:24,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:24,640 INFO L87 Difference]: Start difference. First operand 795 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:10:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:24,787 INFO L93 Difference]: Finished difference Result 1467 states and 5043 transitions. [2020-01-16 18:10:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:24,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:24,791 INFO L225 Difference]: With dead ends: 1467 [2020-01-16 18:10:24,791 INFO L226 Difference]: Without dead ends: 1451 [2020-01-16 18:10:24,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-01-16 18:10:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-01-16 18:10:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-01-16 18:10:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3143 transitions. [2020-01-16 18:10:24,813 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3143 transitions. Word has length 25 [2020-01-16 18:10:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:24,813 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 3143 transitions. [2020-01-16 18:10:24,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3143 transitions. [2020-01-16 18:10:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:24,814 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:24,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:24,814 INFO L426 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2004503825, now seen corresponding path program 718 times [2020-01-16 18:10:24,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:24,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919736798] [2020-01-16 18:10:24,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:25,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919736798] [2020-01-16 18:10:25,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:25,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:25,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118214909] [2020-01-16 18:10:25,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:25,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:25,297 INFO L87 Difference]: Start difference. First operand 804 states and 3143 transitions. Second operand 10 states. [2020-01-16 18:10:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:25,416 INFO L93 Difference]: Finished difference Result 1469 states and 5039 transitions. [2020-01-16 18:10:25,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:25,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:25,419 INFO L225 Difference]: With dead ends: 1469 [2020-01-16 18:10:25,419 INFO L226 Difference]: Without dead ends: 1442 [2020-01-16 18:10:25,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-01-16 18:10:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 795. [2020-01-16 18:10:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-01-16 18:10:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3120 transitions. [2020-01-16 18:10:25,441 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3120 transitions. Word has length 25 [2020-01-16 18:10:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:25,441 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 3120 transitions. [2020-01-16 18:10:25,441 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3120 transitions. [2020-01-16 18:10:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:25,442 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:25,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:25,442 INFO L426 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1206874987, now seen corresponding path program 719 times [2020-01-16 18:10:25,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:25,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762799152] [2020-01-16 18:10:25,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:25,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762799152] [2020-01-16 18:10:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:25,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:25,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431490324] [2020-01-16 18:10:25,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:25,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:25,896 INFO L87 Difference]: Start difference. First operand 795 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:10:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:26,043 INFO L93 Difference]: Finished difference Result 1460 states and 5021 transitions. [2020-01-16 18:10:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:26,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:26,047 INFO L225 Difference]: With dead ends: 1460 [2020-01-16 18:10:26,047 INFO L226 Difference]: Without dead ends: 1446 [2020-01-16 18:10:26,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-01-16 18:10:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 801. [2020-01-16 18:10:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-01-16 18:10:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3131 transitions. [2020-01-16 18:10:26,070 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3131 transitions. Word has length 25 [2020-01-16 18:10:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:26,070 INFO L478 AbstractCegarLoop]: Abstraction has 801 states and 3131 transitions. [2020-01-16 18:10:26,070 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3131 transitions. [2020-01-16 18:10:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:26,071 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:26,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:26,071 INFO L426 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 404065971, now seen corresponding path program 720 times [2020-01-16 18:10:26,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:26,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523875945] [2020-01-16 18:10:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:26,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523875945] [2020-01-16 18:10:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:26,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119540245] [2020-01-16 18:10:26,524 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:26,524 INFO L87 Difference]: Start difference. First operand 801 states and 3131 transitions. Second operand 10 states. [2020-01-16 18:10:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:26,666 INFO L93 Difference]: Finished difference Result 1464 states and 5023 transitions. [2020-01-16 18:10:26,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:26,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:26,669 INFO L225 Difference]: With dead ends: 1464 [2020-01-16 18:10:26,669 INFO L226 Difference]: Without dead ends: 1412 [2020-01-16 18:10:26,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-01-16 18:10:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 767. [2020-01-16 18:10:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-01-16 18:10:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3065 transitions. [2020-01-16 18:10:26,689 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3065 transitions. Word has length 25 [2020-01-16 18:10:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:26,690 INFO L478 AbstractCegarLoop]: Abstraction has 767 states and 3065 transitions. [2020-01-16 18:10:26,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3065 transitions. [2020-01-16 18:10:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:26,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:26,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:26,691 INFO L426 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1154951873, now seen corresponding path program 721 times [2020-01-16 18:10:26,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:26,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322775144] [2020-01-16 18:10:26,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:27,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322775144] [2020-01-16 18:10:27,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:27,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:27,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431056648] [2020-01-16 18:10:27,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:27,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:27,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:27,119 INFO L87 Difference]: Start difference. First operand 767 states and 3065 transitions. Second operand 10 states. [2020-01-16 18:10:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:27,271 INFO L93 Difference]: Finished difference Result 1241 states and 4395 transitions. [2020-01-16 18:10:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:27,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:27,275 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:10:27,275 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:10:27,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:10:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-01-16 18:10:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:10:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-01-16 18:10:27,297 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-01-16 18:10:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:27,298 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-01-16 18:10:27,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-01-16 18:10:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:27,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:27,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] [2020-01-16 18:10:27,299 INFO L426 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash -184700259, now seen corresponding path program 722 times [2020-01-16 18:10:27,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:27,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111112680] [2020-01-16 18:10:27,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:27,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111112680] [2020-01-16 18:10:27,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:27,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:27,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661438017] [2020-01-16 18:10:27,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:27,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:27,725 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-01-16 18:10:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:27,881 INFO L93 Difference]: Finished difference Result 1243 states and 4395 transitions. [2020-01-16 18:10:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:27,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:27,885 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:10:27,885 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:10:27,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:10:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:10:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3117 transitions. [2020-01-16 18:10:27,908 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3117 transitions. Word has length 25 [2020-01-16 18:10:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:27,908 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3117 transitions. [2020-01-16 18:10:27,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3117 transitions. [2020-01-16 18:10:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:27,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:27,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] [2020-01-16 18:10:27,909 INFO L426 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 771082205, now seen corresponding path program 723 times [2020-01-16 18:10:27,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:27,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955180593] [2020-01-16 18:10:27,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:28,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955180593] [2020-01-16 18:10:28,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:28,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:28,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316989640] [2020-01-16 18:10:28,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:28,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:28,452 INFO L87 Difference]: Start difference. First operand 778 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:10:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:28,612 INFO L93 Difference]: Finished difference Result 1237 states and 4383 transitions. [2020-01-16 18:10:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:28,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:28,616 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:10:28,616 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:10:28,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:10:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-01-16 18:10:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3122 transitions. [2020-01-16 18:10:28,637 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3122 transitions. Word has length 25 [2020-01-16 18:10:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:28,637 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3122 transitions. [2020-01-16 18:10:28,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3122 transitions. [2020-01-16 18:10:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:28,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:28,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:28,639 INFO L426 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1751836923, now seen corresponding path program 724 times [2020-01-16 18:10:28,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:28,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018978154] [2020-01-16 18:10:28,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:29,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018978154] [2020-01-16 18:10:29,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:29,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:29,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250839179] [2020-01-16 18:10:29,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:29,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:29,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:29,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:29,066 INFO L87 Difference]: Start difference. First operand 781 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:10:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:29,242 INFO L93 Difference]: Finished difference Result 1236 states and 4378 transitions. [2020-01-16 18:10:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:29,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:29,246 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:10:29,246 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:10:29,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:10:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-01-16 18:10:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-01-16 18:10:29,268 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-01-16 18:10:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:29,268 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-01-16 18:10:29,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-01-16 18:10:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:29,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:29,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:29,269 INFO L426 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 153924927, now seen corresponding path program 725 times [2020-01-16 18:10:29,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:29,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196657408] [2020-01-16 18:10:29,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:29,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196657408] [2020-01-16 18:10:29,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:29,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:29,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748979559] [2020-01-16 18:10:29,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:29,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:29,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:29,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:29,724 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:10:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:29,878 INFO L93 Difference]: Finished difference Result 1241 states and 4388 transitions. [2020-01-16 18:10:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:29,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:29,882 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:10:29,882 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:10:29,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:10:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:10:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:10:29,903 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:29,903 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:10:29,903 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:10:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:29,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:29,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:29,904 INFO L426 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:29,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1764865885, now seen corresponding path program 726 times [2020-01-16 18:10:29,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:29,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794681406] [2020-01-16 18:10:29,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:30,343 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:10:30,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-01-16 18:10:30,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794681406] [2020-01-16 18:10:30,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:30,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:30,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140204110] [2020-01-16 18:10:30,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:30,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:30,350 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:30,512 INFO L93 Difference]: Finished difference Result 1238 states and 4379 transitions. [2020-01-16 18:10:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:30,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:30,516 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:10:30,516 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:10:30,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:10:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-01-16 18:10:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3106 transitions. [2020-01-16 18:10:30,537 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3106 transitions. Word has length 25 [2020-01-16 18:10:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:30,538 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3106 transitions. [2020-01-16 18:10:30,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3106 transitions. [2020-01-16 18:10:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:30,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:30,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:30,539 INFO L426 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1577437599, now seen corresponding path program 727 times [2020-01-16 18:10:30,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:30,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839267652] [2020-01-16 18:10:30,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:30,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839267652] [2020-01-16 18:10:30,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:30,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:30,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277017998] [2020-01-16 18:10:30,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:30,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:30,965 INFO L87 Difference]: Start difference. First operand 775 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:10:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:31,121 INFO L93 Difference]: Finished difference Result 1250 states and 4416 transitions. [2020-01-16 18:10:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:31,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:31,125 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:10:31,125 INFO L226 Difference]: Without dead ends: 1237 [2020-01-16 18:10:31,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-01-16 18:10:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 783. [2020-01-16 18:10:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3128 transitions. [2020-01-16 18:10:31,147 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3128 transitions. Word has length 25 [2020-01-16 18:10:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:31,147 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3128 transitions. [2020-01-16 18:10:31,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3128 transitions. [2020-01-16 18:10:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:31,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:31,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:31,148 INFO L426 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash -607185985, now seen corresponding path program 728 times [2020-01-16 18:10:31,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475873313] [2020-01-16 18:10:31,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475873313] [2020-01-16 18:10:31,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:31,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:31,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691961154] [2020-01-16 18:10:31,575 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:31,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:31,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:31,575 INFO L87 Difference]: Start difference. First operand 783 states and 3128 transitions. Second operand 10 states. [2020-01-16 18:10:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:31,765 INFO L93 Difference]: Finished difference Result 1252 states and 4416 transitions. [2020-01-16 18:10:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:31,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:31,769 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:10:31,769 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:10:31,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:10:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 779. [2020-01-16 18:10:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:10:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3117 transitions. [2020-01-16 18:10:31,791 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3117 transitions. Word has length 25 [2020-01-16 18:10:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:31,791 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3117 transitions. [2020-01-16 18:10:31,791 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3117 transitions. [2020-01-16 18:10:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:31,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:31,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:31,792 INFO L426 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:31,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:31,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2020336739, now seen corresponding path program 729 times [2020-01-16 18:10:31,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:31,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352108335] [2020-01-16 18:10:31,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:32,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-01-16 18:10:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352108335] [2020-01-16 18:10:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:32,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619079938] [2020-01-16 18:10:32,234 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:32,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:32,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:32,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:32,234 INFO L87 Difference]: Start difference. First operand 779 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:10:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:32,390 INFO L93 Difference]: Finished difference Result 1251 states and 4414 transitions. [2020-01-16 18:10:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:32,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:32,394 INFO L225 Difference]: With dead ends: 1251 [2020-01-16 18:10:32,394 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:10:32,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:10:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-01-16 18:10:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-01-16 18:10:32,417 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-01-16 18:10:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:32,417 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-01-16 18:10:32,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-01-16 18:10:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:32,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:32,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:32,418 INFO L426 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1029078917, now seen corresponding path program 730 times [2020-01-16 18:10:32,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:32,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306450928] [2020-01-16 18:10:32,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:32,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306450928] [2020-01-16 18:10:32,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:32,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:32,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79022097] [2020-01-16 18:10:32,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:32,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:32,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:32,846 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:10:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:33,005 INFO L93 Difference]: Finished difference Result 1254 states and 4416 transitions. [2020-01-16 18:10:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:33,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:33,008 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:10:33,008 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:10:33,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:10:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 779. [2020-01-16 18:10:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:10:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-01-16 18:10:33,031 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-01-16 18:10:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:33,031 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-01-16 18:10:33,031 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-01-16 18:10:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:33,032 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:33,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] [2020-01-16 18:10:33,032 INFO L426 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 57035425, now seen corresponding path program 731 times [2020-01-16 18:10:33,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:33,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192876272] [2020-01-16 18:10:33,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:33,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-01-16 18:10:33,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192876272] [2020-01-16 18:10:33,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:33,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:33,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229114619] [2020-01-16 18:10:33,471 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:33,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:33,472 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:10:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:33,625 INFO L93 Difference]: Finished difference Result 1257 states and 4424 transitions. [2020-01-16 18:10:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:33,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:33,628 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:10:33,629 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:10:33,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:10:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 785. [2020-01-16 18:10:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:10:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3124 transitions. [2020-01-16 18:10:33,649 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3124 transitions. Word has length 25 [2020-01-16 18:10:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:33,650 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3124 transitions. [2020-01-16 18:10:33,650 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3124 transitions. [2020-01-16 18:10:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:33,651 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:33,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:33,651 INFO L426 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1016049955, now seen corresponding path program 732 times [2020-01-16 18:10:33,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:33,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922507253] [2020-01-16 18:10:33,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:34,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922507253] [2020-01-16 18:10:34,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:34,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:34,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544155915] [2020-01-16 18:10:34,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:34,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:34,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:34,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:34,093 INFO L87 Difference]: Start difference. First operand 785 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:10:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:34,257 INFO L93 Difference]: Finished difference Result 1258 states and 4420 transitions. [2020-01-16 18:10:34,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:34,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:34,261 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:10:34,261 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:10:34,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:10:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 775. [2020-01-16 18:10:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-01-16 18:10:34,282 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-01-16 18:10:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:34,282 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-01-16 18:10:34,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-01-16 18:10:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:34,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:34,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:34,284 INFO L426 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash -73889247, now seen corresponding path program 733 times [2020-01-16 18:10:34,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:34,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934268983] [2020-01-16 18:10:34,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:34,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934268983] [2020-01-16 18:10:34,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:34,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:34,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149227172] [2020-01-16 18:10:34,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:34,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:34,717 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:10:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:34,872 INFO L93 Difference]: Finished difference Result 1238 states and 4382 transitions. [2020-01-16 18:10:34,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:34,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:34,876 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:10:34,876 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:10:34,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:10:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-01-16 18:10:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:10:34,896 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:34,896 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:10:34,896 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:10:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:34,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:34,897 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:34,897 INFO L426 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 906865471, now seen corresponding path program 734 times [2020-01-16 18:10:34,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679507367] [2020-01-16 18:10:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:35,341 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:10:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:35,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679507367] [2020-01-16 18:10:35,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:35,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:35,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044294417] [2020-01-16 18:10:35,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:35,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:35,348 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:35,511 INFO L93 Difference]: Finished difference Result 1237 states and 4377 transitions. [2020-01-16 18:10:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:35,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:35,514 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:10:35,514 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:10:35,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:10:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-01-16 18:10:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-01-16 18:10:35,534 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-01-16 18:10:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:35,534 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-01-16 18:10:35,534 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-01-16 18:10:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:35,535 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:35,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] [2020-01-16 18:10:35,535 INFO L426 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1852144831, now seen corresponding path program 735 times [2020-01-16 18:10:35,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:35,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910015096] [2020-01-16 18:10:35,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:35,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910015096] [2020-01-16 18:10:35,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:35,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:35,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487746092] [2020-01-16 18:10:35,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:35,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:35,965 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:10:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:36,115 INFO L93 Difference]: Finished difference Result 1243 states and 4390 transitions. [2020-01-16 18:10:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:36,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:36,119 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:10:36,119 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:10:36,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:10:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 782. [2020-01-16 18:10:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:10:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-01-16 18:10:36,140 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-01-16 18:10:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:36,140 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-01-16 18:10:36,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-01-16 18:10:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:36,141 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:36,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:36,141 INFO L426 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1451564643, now seen corresponding path program 736 times [2020-01-16 18:10:36,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:36,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238278492] [2020-01-16 18:10:36,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:36,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-01-16 18:10:36,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238278492] [2020-01-16 18:10:36,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:36,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:36,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399364179] [2020-01-16 18:10:36,570 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:36,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:36,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:36,570 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:10:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:36,737 INFO L93 Difference]: Finished difference Result 1246 states and 4392 transitions. [2020-01-16 18:10:36,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:36,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:36,741 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:10:36,741 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:10:36,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:10:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 778. [2020-01-16 18:10:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:10:36,762 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:10:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:36,762 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:10:36,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:10:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:36,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:36,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] [2020-01-16 18:10:36,764 INFO L426 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1571086881, now seen corresponding path program 737 times [2020-01-16 18:10:36,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:36,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500559879] [2020-01-16 18:10:36,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:37,066 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2020-01-16 18:10:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:37,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500559879] [2020-01-16 18:10:37,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:37,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:37,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949386354] [2020-01-16 18:10:37,354 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:37,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:37,355 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:10:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:37,522 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-01-16 18:10:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:37,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:37,525 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:10:37,525 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:10:37,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:10:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-01-16 18:10:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:10:37,546 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:10:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:37,546 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:10:37,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:10:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:37,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:37,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:37,547 INFO L426 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1112939457, now seen corresponding path program 738 times [2020-01-16 18:10:37,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:37,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365839483] [2020-01-16 18:10:37,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:37,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365839483] [2020-01-16 18:10:37,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:37,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83077875] [2020-01-16 18:10:37,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:37,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:37,978 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:10:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:38,147 INFO L93 Difference]: Finished difference Result 1244 states and 4385 transitions. [2020-01-16 18:10:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:38,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:38,150 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:10:38,151 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:10:38,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:10:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 775. [2020-01-16 18:10:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-01-16 18:10:38,172 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-01-16 18:10:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:38,172 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-01-16 18:10:38,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-01-16 18:10:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:38,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:38,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] [2020-01-16 18:10:38,173 INFO L426 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash -730047843, now seen corresponding path program 739 times [2020-01-16 18:10:38,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:38,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12568646] [2020-01-16 18:10:38,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:38,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12568646] [2020-01-16 18:10:38,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:38,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:38,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756285843] [2020-01-16 18:10:38,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:38,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:38,631 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:10:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:38,790 INFO L93 Difference]: Finished difference Result 1246 states and 4397 transitions. [2020-01-16 18:10:38,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:38,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:38,794 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:10:38,794 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:10:38,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:10:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-01-16 18:10:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:10:38,824 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:10:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:38,824 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:10:38,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:10:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:38,825 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:38,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] [2020-01-16 18:10:38,825 INFO L426 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 880893115, now seen corresponding path program 740 times [2020-01-16 18:10:38,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:38,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814948709] [2020-01-16 18:10:38,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:39,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-01-16 18:10:39,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814948709] [2020-01-16 18:10:39,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:39,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:39,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462314223] [2020-01-16 18:10:39,254 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:39,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:39,254 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:10:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:39,463 INFO L93 Difference]: Finished difference Result 1243 states and 4388 transitions. [2020-01-16 18:10:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:39,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:39,467 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:10:39,467 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:10:39,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:10:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 778. [2020-01-16 18:10:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:10:39,488 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:10:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:39,488 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:10:39,488 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:10:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:39,489 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:39,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:39,490 INFO L426 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1964481599, now seen corresponding path program 741 times [2020-01-16 18:10:39,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:39,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671900428] [2020-01-16 18:10:39,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671900428] [2020-01-16 18:10:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:39,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:39,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922557366] [2020-01-16 18:10:39,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:39,920 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:10:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:40,080 INFO L93 Difference]: Finished difference Result 1253 states and 4411 transitions. [2020-01-16 18:10:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:40,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:40,084 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:10:40,084 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:10:40,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:10:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 784. [2020-01-16 18:10:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:10:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:10:40,106 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:40,106 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:10:40,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:10:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:40,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:40,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:40,107 INFO L426 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 891396219, now seen corresponding path program 742 times [2020-01-16 18:10:40,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:40,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043843031] [2020-01-16 18:10:40,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:40,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043843031] [2020-01-16 18:10:40,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:40,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:40,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668966058] [2020-01-16 18:10:40,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:40,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:40,547 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:40,715 INFO L93 Difference]: Finished difference Result 1254 states and 4407 transitions. [2020-01-16 18:10:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:40,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:40,718 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:10:40,719 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:10:40,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:10:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-01-16 18:10:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:10:40,740 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:10:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:40,740 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:10:40,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:10:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:40,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:40,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:40,741 INFO L426 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1974984703, now seen corresponding path program 743 times [2020-01-16 18:10:40,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:40,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314621309] [2020-01-16 18:10:40,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:41,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314621309] [2020-01-16 18:10:41,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:41,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:41,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356246279] [2020-01-16 18:10:41,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:41,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:41,177 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:10:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:41,358 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:10:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:41,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:41,362 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:10:41,362 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:10:41,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:10:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:10:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:10:41,383 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:10:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:41,384 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:10:41,384 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:10:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:41,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:41,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] [2020-01-16 18:10:41,385 INFO L426 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -709041635, now seen corresponding path program 744 times [2020-01-16 18:10:41,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:41,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306202157] [2020-01-16 18:10:41,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306202157] [2020-01-16 18:10:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784939654] [2020-01-16 18:10:41,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:41,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:41,817 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:10:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:41,987 INFO L93 Difference]: Finished difference Result 1248 states and 4392 transitions. [2020-01-16 18:10:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:41,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:41,990 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:10:41,990 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:10:41,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:10:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 772. [2020-01-16 18:10:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:10:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3092 transitions. [2020-01-16 18:10:42,010 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3092 transitions. Word has length 25 [2020-01-16 18:10:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:42,010 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3092 transitions. [2020-01-16 18:10:42,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3092 transitions. [2020-01-16 18:10:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:42,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:42,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:42,012 INFO L426 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1367107491, now seen corresponding path program 745 times [2020-01-16 18:10:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868098973] [2020-01-16 18:10:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:42,444 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:10:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:42,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868098973] [2020-01-16 18:10:42,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:42,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:42,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22196895] [2020-01-16 18:10:42,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:42,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:42,451 INFO L87 Difference]: Start difference. First operand 772 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:10:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:42,617 INFO L93 Difference]: Finished difference Result 1238 states and 4385 transitions. [2020-01-16 18:10:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:42,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:42,620 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:10:42,620 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:10:42,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:10:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 782. [2020-01-16 18:10:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:10:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-01-16 18:10:42,642 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-01-16 18:10:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:42,642 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-01-16 18:10:42,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-01-16 18:10:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:42,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:42,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:42,644 INFO L426 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash -396855877, now seen corresponding path program 746 times [2020-01-16 18:10:42,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:42,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266636124] [2020-01-16 18:10:42,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:43,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266636124] [2020-01-16 18:10:43,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:43,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:43,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361297954] [2020-01-16 18:10:43,080 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:43,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:43,080 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:10:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:43,244 INFO L93 Difference]: Finished difference Result 1240 states and 4385 transitions. [2020-01-16 18:10:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:43,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:43,248 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:10:43,248 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:10:43,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:10:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-01-16 18:10:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-01-16 18:10:43,270 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-01-16 18:10:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:43,270 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-01-16 18:10:43,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-01-16 18:10:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:43,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:43,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:43,272 INFO L426 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash 558926587, now seen corresponding path program 747 times [2020-01-16 18:10:43,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:43,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914056385] [2020-01-16 18:10:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:43,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914056385] [2020-01-16 18:10:43,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:43,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:43,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514641069] [2020-01-16 18:10:43,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:43,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:43,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:43,716 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:10:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:43,916 INFO L93 Difference]: Finished difference Result 1234 states and 4373 transitions. [2020-01-16 18:10:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:43,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:43,920 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:10:43,920 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:10:43,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:10:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:10:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:10:43,941 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:43,941 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:10:43,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:10:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:43,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:43,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:43,943 INFO L426 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1539681305, now seen corresponding path program 748 times [2020-01-16 18:10:43,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:43,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714085921] [2020-01-16 18:10:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:44,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714085921] [2020-01-16 18:10:44,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:44,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:44,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881646855] [2020-01-16 18:10:44,386 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:44,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:44,386 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:44,551 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-01-16 18:10:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:44,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:44,555 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:10:44,555 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:10:44,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:10:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:10:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-01-16 18:10:44,576 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-01-16 18:10:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:44,576 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-01-16 18:10:44,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-01-16 18:10:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:44,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:44,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:44,577 INFO L426 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash -58230691, now seen corresponding path program 749 times [2020-01-16 18:10:44,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:44,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873491382] [2020-01-16 18:10:44,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:45,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-01-16 18:10:45,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873491382] [2020-01-16 18:10:45,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:45,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:45,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665804943] [2020-01-16 18:10:45,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:45,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:45,008 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:10:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:45,164 INFO L93 Difference]: Finished difference Result 1238 states and 4378 transitions. [2020-01-16 18:10:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:45,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:45,168 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:10:45,169 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:10:45,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:10:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-01-16 18:10:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:10:45,190 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:10:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:45,190 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:10:45,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:10:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:45,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:45,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:45,191 INFO L426 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1552710267, now seen corresponding path program 750 times [2020-01-16 18:10:45,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:45,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974015863] [2020-01-16 18:10:45,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:45,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974015863] [2020-01-16 18:10:45,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:45,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:45,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117754246] [2020-01-16 18:10:45,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:45,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:45,628 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:10:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:45,804 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-01-16 18:10:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:45,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:45,808 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:10:45,808 INFO L226 Difference]: Without dead ends: 1217 [2020-01-16 18:10:45,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-01-16 18:10:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 775. [2020-01-16 18:10:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-01-16 18:10:45,829 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-01-16 18:10:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:45,829 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-01-16 18:10:45,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-01-16 18:10:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:45,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:45,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:45,830 INFO L426 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2082888353, now seen corresponding path program 751 times [2020-01-16 18:10:45,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:45,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121641706] [2020-01-16 18:10:45,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:46,271 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:10:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:46,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121641706] [2020-01-16 18:10:46,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:46,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:46,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847713850] [2020-01-16 18:10:46,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:46,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:46,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:46,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:46,278 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:10:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:46,494 INFO L93 Difference]: Finished difference Result 1244 states and 4399 transitions. [2020-01-16 18:10:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:46,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:46,498 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:10:46,498 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:10:46,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:10:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 783. [2020-01-16 18:10:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3125 transitions. [2020-01-16 18:10:46,519 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3125 transitions. Word has length 25 [2020-01-16 18:10:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:46,519 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3125 transitions. [2020-01-16 18:10:46,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3125 transitions. [2020-01-16 18:10:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:46,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:46,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:46,521 INFO L426 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:46,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:46,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1241827329, now seen corresponding path program 752 times [2020-01-16 18:10:46,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:46,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531932260] [2020-01-16 18:10:46,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:46,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531932260] [2020-01-16 18:10:46,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:46,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:46,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424022037] [2020-01-16 18:10:46,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:46,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:46,974 INFO L87 Difference]: Start difference. First operand 783 states and 3125 transitions. Second operand 10 states. [2020-01-16 18:10:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:47,137 INFO L93 Difference]: Finished difference Result 1246 states and 4399 transitions. [2020-01-16 18:10:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:47,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:47,141 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:10:47,141 INFO L226 Difference]: Without dead ends: 1227 [2020-01-16 18:10:47,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-01-16 18:10:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 779. [2020-01-16 18:10:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:10:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3114 transitions. [2020-01-16 18:10:47,163 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3114 transitions. Word has length 25 [2020-01-16 18:10:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:47,163 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3114 transitions. [2020-01-16 18:10:47,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3114 transitions. [2020-01-16 18:10:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:47,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:47,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:47,164 INFO L426 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -728944005, now seen corresponding path program 753 times [2020-01-16 18:10:47,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:47,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941643841] [2020-01-16 18:10:47,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941643841] [2020-01-16 18:10:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707174790] [2020-01-16 18:10:47,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:47,633 INFO L87 Difference]: Start difference. First operand 779 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:10:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:47,790 INFO L93 Difference]: Finished difference Result 1243 states and 4393 transitions. [2020-01-16 18:10:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:47,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:47,794 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:10:47,794 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:10:47,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:10:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:10:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3121 transitions. [2020-01-16 18:10:47,815 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3121 transitions. Word has length 25 [2020-01-16 18:10:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:47,816 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3121 transitions. [2020-01-16 18:10:47,816 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3121 transitions. [2020-01-16 18:10:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:47,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:47,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:47,817 INFO L426 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 272816921, now seen corresponding path program 754 times [2020-01-16 18:10:47,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:47,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975160668] [2020-01-16 18:10:47,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975160668] [2020-01-16 18:10:48,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:48,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:48,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980383706] [2020-01-16 18:10:48,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:48,256 INFO L87 Difference]: Start difference. First operand 783 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:10:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:48,428 INFO L93 Difference]: Finished difference Result 1244 states and 4391 transitions. [2020-01-16 18:10:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:48,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:48,431 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:10:48,432 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:10:48,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:10:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:10:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:10:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3110 transitions. [2020-01-16 18:10:48,453 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3110 transitions. Word has length 25 [2020-01-16 18:10:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:48,453 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3110 transitions. [2020-01-16 18:10:48,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3110 transitions. [2020-01-16 18:10:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:48,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:48,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] [2020-01-16 18:10:48,454 INFO L426 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -252009695, now seen corresponding path program 755 times [2020-01-16 18:10:48,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:48,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448355749] [2020-01-16 18:10:48,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:48,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448355749] [2020-01-16 18:10:48,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:48,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:48,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457721109] [2020-01-16 18:10:48,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:48,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:48,898 INFO L87 Difference]: Start difference. First operand 779 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:10:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:49,065 INFO L93 Difference]: Finished difference Result 1248 states and 4400 transitions. [2020-01-16 18:10:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:49,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:49,069 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:10:49,069 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:10:49,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:10:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 784. [2020-01-16 18:10:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:10:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-01-16 18:10:49,091 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:49,091 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-01-16 18:10:49,091 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-01-16 18:10:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:49,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:49,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:49,092 INFO L426 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash 285845883, now seen corresponding path program 756 times [2020-01-16 18:10:49,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:49,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730454467] [2020-01-16 18:10:49,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:49,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-01-16 18:10:49,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730454467] [2020-01-16 18:10:49,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:49,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:49,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473995305] [2020-01-16 18:10:49,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:49,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:49,530 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:49,698 INFO L93 Difference]: Finished difference Result 1247 states and 4393 transitions. [2020-01-16 18:10:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:49,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:49,702 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:10:49,702 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:10:49,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:10:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 775. [2020-01-16 18:10:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-01-16 18:10:49,724 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-01-16 18:10:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:49,724 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-01-16 18:10:49,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-01-16 18:10:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:49,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:49,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:49,725 INFO L426 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -708530591, now seen corresponding path program 757 times [2020-01-16 18:10:49,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:49,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327759649] [2020-01-16 18:10:49,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:50,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327759649] [2020-01-16 18:10:50,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:50,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:50,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632880988] [2020-01-16 18:10:50,173 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:50,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:50,173 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:10:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:50,360 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-01-16 18:10:50,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:50,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:50,364 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:10:50,364 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:10:50,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:10:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 781. [2020-01-16 18:10:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:10:50,396 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:10:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:50,396 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:10:50,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:10:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:50,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:50,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:50,397 INFO L426 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 272224127, now seen corresponding path program 758 times [2020-01-16 18:10:50,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:50,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096499057] [2020-01-16 18:10:50,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:50,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096499057] [2020-01-16 18:10:50,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:50,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:50,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125918399] [2020-01-16 18:10:50,846 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:50,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:50,846 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:10:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:51,013 INFO L93 Difference]: Finished difference Result 1232 states and 4363 transitions. [2020-01-16 18:10:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:51,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:51,016 INFO L225 Difference]: With dead ends: 1232 [2020-01-16 18:10:51,017 INFO L226 Difference]: Without dead ends: 1217 [2020-01-16 18:10:51,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-01-16 18:10:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 778. [2020-01-16 18:10:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:10:51,037 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:10:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:51,038 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:10:51,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:10:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:51,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:51,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:51,039 INFO L426 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1151429731, now seen corresponding path program 759 times [2020-01-16 18:10:51,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:51,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329701873] [2020-01-16 18:10:51,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:51,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329701873] [2020-01-16 18:10:51,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:51,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:51,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260957041] [2020-01-16 18:10:51,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:51,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:51,483 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:10:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:51,637 INFO L93 Difference]: Finished difference Result 1236 states and 4372 transitions. [2020-01-16 18:10:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:51,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:51,641 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:10:51,641 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:10:51,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:10:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 782. [2020-01-16 18:10:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:10:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-01-16 18:10:51,663 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-01-16 18:10:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:51,663 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-01-16 18:10:51,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-01-16 18:10:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:51,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:51,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:51,664 INFO L426 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -149668805, now seen corresponding path program 760 times [2020-01-16 18:10:51,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:51,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69653095] [2020-01-16 18:10:51,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:52,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-01-16 18:10:52,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69653095] [2020-01-16 18:10:52,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:52,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:52,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935242416] [2020-01-16 18:10:52,109 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:52,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:52,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:52,110 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:10:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:52,266 INFO L93 Difference]: Finished difference Result 1237 states and 4370 transitions. [2020-01-16 18:10:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:52,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:52,269 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:10:52,270 INFO L226 Difference]: Without dead ends: 1219 [2020-01-16 18:10:52,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-01-16 18:10:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 778. [2020-01-16 18:10:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:10:52,291 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:10:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:52,291 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:10:52,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:10:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:52,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:52,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:52,292 INFO L426 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1262041761, now seen corresponding path program 761 times [2020-01-16 18:10:52,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:52,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237905091] [2020-01-16 18:10:52,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:52,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237905091] [2020-01-16 18:10:52,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:52,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:52,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236400753] [2020-01-16 18:10:52,746 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:52,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:52,749 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:10:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:52,903 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-01-16 18:10:52,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:52,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:52,906 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:10:52,906 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:10:52,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:10:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:10:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:10:52,927 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:10:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:52,927 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:10:52,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:10:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:52,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:52,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:52,929 INFO L426 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 188956381, now seen corresponding path program 762 times [2020-01-16 18:10:52,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:52,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729512937] [2020-01-16 18:10:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:53,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-01-16 18:10:53,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729512937] [2020-01-16 18:10:53,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:53,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:53,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749654639] [2020-01-16 18:10:53,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:53,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:53,370 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:10:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:53,526 INFO L93 Difference]: Finished difference Result 1235 states and 4363 transitions. [2020-01-16 18:10:53,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:53,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:53,530 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:10:53,530 INFO L226 Difference]: Without dead ends: 1215 [2020-01-16 18:10:53,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-01-16 18:10:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 775. [2020-01-16 18:10:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:10:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:10:53,552 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:10:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:53,552 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:10:53,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:10:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:53,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:53,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] [2020-01-16 18:10:53,553 INFO L426 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash 561344891, now seen corresponding path program 763 times [2020-01-16 18:10:53,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:53,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793675874] [2020-01-16 18:10:53,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:53,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793675874] [2020-01-16 18:10:53,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:53,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:53,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993283197] [2020-01-16 18:10:53,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:53,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:53,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:53,993 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:10:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:54,148 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-01-16 18:10:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:54,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:54,151 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:10:54,151 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:10:54,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:10:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-01-16 18:10:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:10:54,172 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:10:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:54,172 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:10:54,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:10:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:54,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:54,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] [2020-01-16 18:10:54,173 INFO L426 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2122681447, now seen corresponding path program 764 times [2020-01-16 18:10:54,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:54,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112293380] [2020-01-16 18:10:54,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:54,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112293380] [2020-01-16 18:10:54,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:54,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:54,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593055292] [2020-01-16 18:10:54,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:54,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:54,641 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:10:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:54,791 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-01-16 18:10:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:54,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:54,795 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:10:54,795 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:10:54,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:10:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-01-16 18:10:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:10:54,816 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:10:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:54,816 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:10:54,816 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:10:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:54,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:54,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:54,817 INFO L426 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436479, now seen corresponding path program 765 times [2020-01-16 18:10:54,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:54,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512775730] [2020-01-16 18:10:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:55,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512775730] [2020-01-16 18:10:55,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:55,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:55,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457573747] [2020-01-16 18:10:55,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:55,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:55,255 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:10:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:55,406 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:10:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:55,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:55,410 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:10:55,410 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:10:55,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:10:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-01-16 18:10:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:10:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3114 transitions. [2020-01-16 18:10:55,432 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3114 transitions. Word has length 25 [2020-01-16 18:10:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:55,432 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3114 transitions. [2020-01-16 18:10:55,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3114 transitions. [2020-01-16 18:10:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:55,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:55,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:55,433 INFO L426 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2101675239, now seen corresponding path program 766 times [2020-01-16 18:10:55,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:55,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235347967] [2020-01-16 18:10:55,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:55,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235347967] [2020-01-16 18:10:55,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:55,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:55,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064994838] [2020-01-16 18:10:55,860 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:55,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:55,861 INFO L87 Difference]: Start difference. First operand 783 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:10:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:56,027 INFO L93 Difference]: Finished difference Result 1243 states and 4380 transitions. [2020-01-16 18:10:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:56,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:56,031 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:10:56,031 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:10:56,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:10:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:10:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:10:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:10:56,053 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:10:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:56,053 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:10:56,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:10:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:56,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:56,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] [2020-01-16 18:10:56,055 INFO L426 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1665939583, now seen corresponding path program 767 times [2020-01-16 18:10:56,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:56,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927831352] [2020-01-16 18:10:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:56,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927831352] [2020-01-16 18:10:56,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:56,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:56,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677980250] [2020-01-16 18:10:56,486 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:56,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:56,486 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:10:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:56,658 INFO L93 Difference]: Finished difference Result 1236 states and 4366 transitions. [2020-01-16 18:10:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:56,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:56,662 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:10:56,662 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:10:56,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:10:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-01-16 18:10:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:10:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:10:56,683 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:10:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:56,683 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:10:56,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:10:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:56,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:56,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] [2020-01-16 18:10:56,685 INFO L426 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 592854203, now seen corresponding path program 768 times [2020-01-16 18:10:56,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:56,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451771636] [2020-01-16 18:10:56,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:57,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451771636] [2020-01-16 18:10:57,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:57,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:57,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191997853] [2020-01-16 18:10:57,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:57,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:57,136 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:10:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:57,288 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-01-16 18:10:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:57,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:57,291 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:10:57,292 INFO L226 Difference]: Without dead ends: 1215 [2020-01-16 18:10:57,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-01-16 18:10:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 772. [2020-01-16 18:10:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:10:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3089 transitions. [2020-01-16 18:10:57,313 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3089 transitions. Word has length 25 [2020-01-16 18:10:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:57,314 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3089 transitions. [2020-01-16 18:10:57,314 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3089 transitions. [2020-01-16 18:10:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:57,315 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:57,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:57,315 INFO L426 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2001748835, now seen corresponding path program 769 times [2020-01-16 18:10:57,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:57,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154620820] [2020-01-16 18:10:57,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:57,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154620820] [2020-01-16 18:10:57,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:57,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:57,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852721658] [2020-01-16 18:10:57,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:57,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:57,753 INFO L87 Difference]: Start difference. First operand 772 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:10:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:57,926 INFO L93 Difference]: Finished difference Result 1262 states and 4453 transitions. [2020-01-16 18:10:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:57,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:57,929 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:10:57,929 INFO L226 Difference]: Without dead ends: 1249 [2020-01-16 18:10:57,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-01-16 18:10:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2020-01-16 18:10:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:10:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-01-16 18:10:57,951 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-01-16 18:10:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:57,951 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-01-16 18:10:57,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-01-16 18:10:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:57,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:57,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:57,953 INFO L426 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1031497221, now seen corresponding path program 770 times [2020-01-16 18:10:57,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:57,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893647552] [2020-01-16 18:10:57,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:58,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-01-16 18:10:58,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893647552] [2020-01-16 18:10:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:58,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:58,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264829601] [2020-01-16 18:10:58,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:58,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:58,376 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-01-16 18:10:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:58,536 INFO L93 Difference]: Finished difference Result 1264 states and 4453 transitions. [2020-01-16 18:10:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:58,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:58,540 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:10:58,540 INFO L226 Difference]: Without dead ends: 1245 [2020-01-16 18:10:58,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-01-16 18:10:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 780. [2020-01-16 18:10:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:10:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3119 transitions. [2020-01-16 18:10:58,561 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3119 transitions. Word has length 25 [2020-01-16 18:10:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:58,561 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3119 transitions. [2020-01-16 18:10:58,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3119 transitions. [2020-01-16 18:10:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:58,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:58,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:58,563 INFO L426 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1850319321, now seen corresponding path program 771 times [2020-01-16 18:10:58,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:58,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053252725] [2020-01-16 18:10:58,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:59,009 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:10:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:59,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053252725] [2020-01-16 18:10:59,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:59,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:59,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087198250] [2020-01-16 18:10:59,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:59,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:59,016 INFO L87 Difference]: Start difference. First operand 780 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:10:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:59,173 INFO L93 Difference]: Finished difference Result 1263 states and 4451 transitions. [2020-01-16 18:10:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:59,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:59,176 INFO L225 Difference]: With dead ends: 1263 [2020-01-16 18:10:59,177 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:10:59,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:10:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 784. [2020-01-16 18:10:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:10:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-01-16 18:10:59,198 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-01-16 18:10:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:59,199 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-01-16 18:10:59,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-01-16 18:10:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:59,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:59,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:59,200 INFO L426 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1453390153, now seen corresponding path program 772 times [2020-01-16 18:10:59,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:59,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718951496] [2020-01-16 18:10:59,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:10:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:10:59,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718951496] [2020-01-16 18:10:59,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:10:59,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:10:59,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359635160] [2020-01-16 18:10:59,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:10:59,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:10:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:10:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:10:59,636 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:10:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:10:59,796 INFO L93 Difference]: Finished difference Result 1266 states and 4453 transitions. [2020-01-16 18:10:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:10:59,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:10:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:10:59,799 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:10:59,799 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:10:59,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:10:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:10:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 780. [2020-01-16 18:10:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:10:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-01-16 18:10:59,820 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-01-16 18:10:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:10:59,820 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-01-16 18:10:59,820 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:10:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-01-16 18:10:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:10:59,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:10:59,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:10:59,821 INFO L426 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:10:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:10:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash -367275811, now seen corresponding path program 773 times [2020-01-16 18:10:59,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:10:59,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898669260] [2020-01-16 18:10:59,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:10:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:00,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898669260] [2020-01-16 18:11:00,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:00,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029452480] [2020-01-16 18:11:00,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:00,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:00,264 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:11:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:00,414 INFO L93 Difference]: Finished difference Result 1269 states and 4461 transitions. [2020-01-16 18:11:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:00,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:00,418 INFO L225 Difference]: With dead ends: 1269 [2020-01-16 18:11:00,418 INFO L226 Difference]: Without dead ends: 1254 [2020-01-16 18:11:00,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2020-01-16 18:11:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 786. [2020-01-16 18:11:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:11:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3126 transitions. [2020-01-16 18:11:00,439 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3126 transitions. Word has length 25 [2020-01-16 18:11:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:00,440 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3126 transitions. [2020-01-16 18:11:00,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3126 transitions. [2020-01-16 18:11:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:00,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:00,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:00,441 INFO L426 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1440361191, now seen corresponding path program 774 times [2020-01-16 18:11:00,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:00,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970510702] [2020-01-16 18:11:00,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:00,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970510702] [2020-01-16 18:11:00,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:00,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:00,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892684325] [2020-01-16 18:11:00,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:00,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:00,877 INFO L87 Difference]: Start difference. First operand 786 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:11:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:01,027 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-01-16 18:11:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:01,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:01,030 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:11:01,031 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:11:01,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:11:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 776. [2020-01-16 18:11:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:11:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3104 transitions. [2020-01-16 18:11:01,052 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3104 transitions. Word has length 25 [2020-01-16 18:11:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:01,053 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3104 transitions. [2020-01-16 18:11:01,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3104 transitions. [2020-01-16 18:11:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:01,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:01,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:01,054 INFO L426 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1870732735, now seen corresponding path program 775 times [2020-01-16 18:11:01,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:01,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448881549] [2020-01-16 18:11:01,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:01,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448881549] [2020-01-16 18:11:01,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:01,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:01,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898452133] [2020-01-16 18:11:01,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:01,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:01,507 INFO L87 Difference]: Start difference. First operand 776 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:11:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:01,653 INFO L93 Difference]: Finished difference Result 1259 states and 4442 transitions. [2020-01-16 18:11:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:01,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:01,657 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:11:01,657 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:11:01,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:11:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-01-16 18:11:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-01-16 18:11:01,678 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-01-16 18:11:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:01,678 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-01-16 18:11:01,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-01-16 18:11:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:01,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:01,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:01,679 INFO L426 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1453982947, now seen corresponding path program 776 times [2020-01-16 18:11:01,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:01,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100287453] [2020-01-16 18:11:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:02,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100287453] [2020-01-16 18:11:02,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:02,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:02,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887450009] [2020-01-16 18:11:02,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:02,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:02,140 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:11:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:02,320 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-01-16 18:11:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:02,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:02,324 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:11:02,324 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:11:02,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:11:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:11:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-01-16 18:11:02,345 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-01-16 18:11:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:02,346 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-01-16 18:11:02,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-01-16 18:11:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:02,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:02,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:02,347 INFO L426 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -941099623, now seen corresponding path program 777 times [2020-01-16 18:11:02,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:02,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338381095] [2020-01-16 18:11:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:02,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338381095] [2020-01-16 18:11:02,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:02,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:02,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233462923] [2020-01-16 18:11:02,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:02,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:02,789 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:11:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:02,942 INFO L93 Difference]: Finished difference Result 1258 states and 4436 transitions. [2020-01-16 18:11:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:02,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:02,946 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:11:02,946 INFO L226 Difference]: Without dead ends: 1245 [2020-01-16 18:11:02,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-01-16 18:11:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 784. [2020-01-16 18:11:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-01-16 18:11:02,968 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-01-16 18:11:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:02,968 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-01-16 18:11:02,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-01-16 18:11:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:02,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:02,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:02,969 INFO L426 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 60661303, now seen corresponding path program 778 times [2020-01-16 18:11:02,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:02,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620998110] [2020-01-16 18:11:02,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:03,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620998110] [2020-01-16 18:11:03,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:03,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:03,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862428048] [2020-01-16 18:11:03,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:03,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:03,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:03,428 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:11:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:03,580 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-01-16 18:11:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:03,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:03,583 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:11:03,583 INFO L226 Difference]: Without dead ends: 1241 [2020-01-16 18:11:03,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-01-16 18:11:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 780. [2020-01-16 18:11:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:11:03,605 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:03,605 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:11:03,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:11:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:03,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:03,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] [2020-01-16 18:11:03,607 INFO L426 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:03,607 INFO L82 PathProgramCache]: Analyzing trace with hash -464165313, now seen corresponding path program 779 times [2020-01-16 18:11:03,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:03,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299111816] [2020-01-16 18:11:03,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:04,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299111816] [2020-01-16 18:11:04,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:04,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:04,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107808271] [2020-01-16 18:11:04,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:04,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:04,056 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:04,206 INFO L93 Difference]: Finished difference Result 1263 states and 4443 transitions. [2020-01-16 18:11:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:04,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:04,209 INFO L225 Difference]: With dead ends: 1263 [2020-01-16 18:11:04,210 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:11:04,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:11:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-01-16 18:11:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:11:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-01-16 18:11:04,231 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-01-16 18:11:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:04,231 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-01-16 18:11:04,231 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-01-16 18:11:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:04,232 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:04,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:04,232 INFO L426 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash 73690265, now seen corresponding path program 780 times [2020-01-16 18:11:04,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:04,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652545500] [2020-01-16 18:11:04,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:04,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652545500] [2020-01-16 18:11:04,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:04,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:04,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329068707] [2020-01-16 18:11:04,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:04,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:04,673 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:11:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:04,845 INFO L93 Difference]: Finished difference Result 1262 states and 4436 transitions. [2020-01-16 18:11:04,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:04,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:04,849 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:11:04,849 INFO L226 Difference]: Without dead ends: 1239 [2020-01-16 18:11:04,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-01-16 18:11:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 776. [2020-01-16 18:11:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:11:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-01-16 18:11:04,870 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-01-16 18:11:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:04,870 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-01-16 18:11:04,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-01-16 18:11:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:04,871 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:04,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:04,871 INFO L426 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 582862143, now seen corresponding path program 781 times [2020-01-16 18:11:04,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:04,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747535836] [2020-01-16 18:11:04,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:05,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747535836] [2020-01-16 18:11:05,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:05,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:05,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371034060] [2020-01-16 18:11:05,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:05,296 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:11:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:05,450 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-01-16 18:11:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:05,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:05,454 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:11:05,454 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:11:05,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:11:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 784. [2020-01-16 18:11:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-01-16 18:11:05,475 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-01-16 18:11:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:05,475 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-01-16 18:11:05,475 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-01-16 18:11:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:05,476 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:05,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:05,476 INFO L426 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1574119965, now seen corresponding path program 782 times [2020-01-16 18:11:05,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:05,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826891848] [2020-01-16 18:11:05,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:05,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826891848] [2020-01-16 18:11:05,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:05,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988079130] [2020-01-16 18:11:05,924 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:05,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:05,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:05,924 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-01-16 18:11:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:06,090 INFO L93 Difference]: Finished difference Result 1264 states and 4444 transitions. [2020-01-16 18:11:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:06,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:06,094 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:11:06,094 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:11:06,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:11:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-01-16 18:11:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:11:06,115 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:06,116 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:11:06,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:11:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:06,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:06,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:06,117 INFO L426 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1786071075, now seen corresponding path program 783 times [2020-01-16 18:11:06,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:06,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378710558] [2020-01-16 18:11:06,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:06,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-01-16 18:11:06,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378710558] [2020-01-16 18:11:06,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:06,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:06,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521803224] [2020-01-16 18:11:06,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:06,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:06,570 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:06,725 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-01-16 18:11:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:06,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:06,728 INFO L225 Difference]: With dead ends: 1259 [2020-01-16 18:11:06,729 INFO L226 Difference]: Without dead ends: 1246 [2020-01-16 18:11:06,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-01-16 18:11:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-01-16 18:11:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3118 transitions. [2020-01-16 18:11:06,751 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3118 transitions. Word has length 25 [2020-01-16 18:11:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:06,751 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3118 transitions. [2020-01-16 18:11:06,751 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3118 transitions. [2020-01-16 18:11:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:06,752 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:06,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:06,752 INFO L426 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash -784310149, now seen corresponding path program 784 times [2020-01-16 18:11:06,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:06,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40224627] [2020-01-16 18:11:06,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:07,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-01-16 18:11:07,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40224627] [2020-01-16 18:11:07,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:07,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:07,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800765167] [2020-01-16 18:11:07,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:07,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:07,192 INFO L87 Difference]: Start difference. First operand 784 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:11:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:07,374 INFO L93 Difference]: Finished difference Result 1260 states and 4432 transitions. [2020-01-16 18:11:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:07,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:07,378 INFO L225 Difference]: With dead ends: 1260 [2020-01-16 18:11:07,378 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:11:07,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:11:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:11:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3107 transitions. [2020-01-16 18:11:07,401 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3107 transitions. Word has length 25 [2020-01-16 18:11:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:07,401 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3107 transitions. [2020-01-16 18:11:07,401 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3107 transitions. [2020-01-16 18:11:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:07,402 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:07,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:07,402 INFO L426 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1731029697, now seen corresponding path program 785 times [2020-01-16 18:11:07,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:07,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361474359] [2020-01-16 18:11:07,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:07,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361474359] [2020-01-16 18:11:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:07,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002523174] [2020-01-16 18:11:07,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:07,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:07,835 INFO L87 Difference]: Start difference. First operand 780 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:11:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:08,019 INFO L93 Difference]: Finished difference Result 1266 states and 4445 transitions. [2020-01-16 18:11:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:08,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:08,023 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:11:08,023 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:11:08,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:11:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 785. [2020-01-16 18:11:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:11:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3116 transitions. [2020-01-16 18:11:08,045 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:08,045 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3116 transitions. [2020-01-16 18:11:08,045 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3116 transitions. [2020-01-16 18:11:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:08,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:08,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:08,046 INFO L426 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash -120088739, now seen corresponding path program 786 times [2020-01-16 18:11:08,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:08,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030472790] [2020-01-16 18:11:08,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:08,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030472790] [2020-01-16 18:11:08,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:08,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:08,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182002931] [2020-01-16 18:11:08,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:08,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:08,491 INFO L87 Difference]: Start difference. First operand 785 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:08,673 INFO L93 Difference]: Finished difference Result 1264 states and 4436 transitions. [2020-01-16 18:11:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:08,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:08,677 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:11:08,677 INFO L226 Difference]: Without dead ends: 1241 [2020-01-16 18:11:08,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-01-16 18:11:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 776. [2020-01-16 18:11:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:11:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:11:08,702 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:11:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:08,702 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:11:08,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:11:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:08,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:08,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:08,703 INFO L426 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 252299771, now seen corresponding path program 787 times [2020-01-16 18:11:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:08,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106118083] [2020-01-16 18:11:08,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:09,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106118083] [2020-01-16 18:11:09,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:09,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:09,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192431642] [2020-01-16 18:11:09,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:09,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:09,141 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:11:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:09,315 INFO L93 Difference]: Finished difference Result 1273 states and 4469 transitions. [2020-01-16 18:11:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:09,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:09,319 INFO L225 Difference]: With dead ends: 1273 [2020-01-16 18:11:09,319 INFO L226 Difference]: Without dead ends: 1258 [2020-01-16 18:11:09,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2020-01-16 18:11:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 787. [2020-01-16 18:11:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-01-16 18:11:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3126 transitions. [2020-01-16 18:11:09,341 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3126 transitions. Word has length 25 [2020-01-16 18:11:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:09,341 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 3126 transitions. [2020-01-16 18:11:09,341 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3126 transitions. [2020-01-16 18:11:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:09,342 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:09,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] [2020-01-16 18:11:09,342 INFO L426 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:09,343 INFO L82 PathProgramCache]: Analyzing trace with hash -820785609, now seen corresponding path program 788 times [2020-01-16 18:11:09,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:09,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521507182] [2020-01-16 18:11:09,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:09,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521507182] [2020-01-16 18:11:09,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:09,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:09,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789256153] [2020-01-16 18:11:09,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:09,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:09,789 INFO L87 Difference]: Start difference. First operand 787 states and 3126 transitions. Second operand 10 states. [2020-01-16 18:11:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:09,942 INFO L93 Difference]: Finished difference Result 1274 states and 4465 transitions. [2020-01-16 18:11:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:09,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:09,945 INFO L225 Difference]: With dead ends: 1274 [2020-01-16 18:11:09,945 INFO L226 Difference]: Without dead ends: 1252 [2020-01-16 18:11:09,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-01-16 18:11:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 781. [2020-01-16 18:11:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:11:09,967 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:11:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:09,967 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:11:09,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:11:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:09,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:09,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:09,968 INFO L426 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1348138083, now seen corresponding path program 789 times [2020-01-16 18:11:09,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:09,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932783590] [2020-01-16 18:11:09,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:10,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932783590] [2020-01-16 18:11:10,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:10,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:10,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704334904] [2020-01-16 18:11:10,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:10,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:10,425 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:11:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:10,575 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-01-16 18:11:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:10,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:10,578 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:11:10,578 INFO L226 Difference]: Without dead ends: 1255 [2020-01-16 18:11:10,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-01-16 18:11:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 786. [2020-01-16 18:11:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:11:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3119 transitions. [2020-01-16 18:11:10,600 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3119 transitions. Word has length 25 [2020-01-16 18:11:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:10,600 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3119 transitions. [2020-01-16 18:11:10,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3119 transitions. [2020-01-16 18:11:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:10,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:10,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:10,601 INFO L426 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash -810282505, now seen corresponding path program 790 times [2020-01-16 18:11:10,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:10,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433559701] [2020-01-16 18:11:10,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:11,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-01-16 18:11:11,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433559701] [2020-01-16 18:11:11,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:11,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:11,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950268] [2020-01-16 18:11:11,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:11,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:11,043 INFO L87 Difference]: Start difference. First operand 786 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:11:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:11,208 INFO L93 Difference]: Finished difference Result 1269 states and 4450 transitions. [2020-01-16 18:11:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:11,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:11,212 INFO L225 Difference]: With dead ends: 1269 [2020-01-16 18:11:11,212 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:11:11,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:11:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 781. [2020-01-16 18:11:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3105 transitions. [2020-01-16 18:11:11,233 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:11,233 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3105 transitions. [2020-01-16 18:11:11,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3105 transitions. [2020-01-16 18:11:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:11,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:11,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:11,234 INFO L426 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1327131875, now seen corresponding path program 791 times [2020-01-16 18:11:11,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:11,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68493679] [2020-01-16 18:11:11,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:11,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-01-16 18:11:11,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68493679] [2020-01-16 18:11:11,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:11,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:11,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480854415] [2020-01-16 18:11:11,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:11,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:11,669 INFO L87 Difference]: Start difference. First operand 781 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:11,819 INFO L93 Difference]: Finished difference Result 1272 states and 4456 transitions. [2020-01-16 18:11:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:11,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:11,823 INFO L225 Difference]: With dead ends: 1272 [2020-01-16 18:11:11,823 INFO L226 Difference]: Without dead ends: 1256 [2020-01-16 18:11:11,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2020-01-16 18:11:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 786. [2020-01-16 18:11:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:11:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3114 transitions. [2020-01-16 18:11:11,845 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3114 transitions. Word has length 25 [2020-01-16 18:11:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:11,845 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3114 transitions. [2020-01-16 18:11:11,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3114 transitions. [2020-01-16 18:11:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:11,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:11,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:11,846 INFO L426 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 283809083, now seen corresponding path program 792 times [2020-01-16 18:11:11,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:11,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052626599] [2020-01-16 18:11:11,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:12,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052626599] [2020-01-16 18:11:12,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:12,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:12,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735094586] [2020-01-16 18:11:12,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:12,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:12,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:12,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:12,285 INFO L87 Difference]: Start difference. First operand 786 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:11:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:12,466 INFO L93 Difference]: Finished difference Result 1270 states and 4447 transitions. [2020-01-16 18:11:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:12,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:12,469 INFO L225 Difference]: With dead ends: 1270 [2020-01-16 18:11:12,469 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:11:12,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:11:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 772. [2020-01-16 18:11:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:11:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3086 transitions. [2020-01-16 18:11:12,490 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3086 transitions. Word has length 25 [2020-01-16 18:11:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:12,490 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3086 transitions. [2020-01-16 18:11:12,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3086 transitions. [2020-01-16 18:11:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:12,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:12,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:12,492 INFO L426 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash -710356101, now seen corresponding path program 793 times [2020-01-16 18:11:12,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:12,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630637528] [2020-01-16 18:11:12,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:12,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630637528] [2020-01-16 18:11:12,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:12,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:12,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283552225] [2020-01-16 18:11:12,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:12,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:12,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:12,945 INFO L87 Difference]: Start difference. First operand 772 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:11:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:13,102 INFO L93 Difference]: Finished difference Result 1236 states and 4374 transitions. [2020-01-16 18:11:13,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:13,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:13,106 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:11:13,106 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:11:13,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:11:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-01-16 18:11:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-01-16 18:11:13,128 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:13,128 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-01-16 18:11:13,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-01-16 18:11:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:13,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:13,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:13,130 INFO L426 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash 270398617, now seen corresponding path program 794 times [2020-01-16 18:11:13,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:13,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146672519] [2020-01-16 18:11:13,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:13,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146672519] [2020-01-16 18:11:13,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:13,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:13,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195735822] [2020-01-16 18:11:13,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:13,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:13,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:13,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:13,564 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:13,741 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-01-16 18:11:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:13,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:13,744 INFO L225 Difference]: With dead ends: 1235 [2020-01-16 18:11:13,744 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:11:13,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:11:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:11:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-01-16 18:11:13,764 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-01-16 18:11:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:13,764 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-01-16 18:11:13,764 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-01-16 18:11:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:13,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:13,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:13,765 INFO L426 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:13,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677977, now seen corresponding path program 795 times [2020-01-16 18:11:13,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:13,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604307394] [2020-01-16 18:11:13,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604307394] [2020-01-16 18:11:14,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:14,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572349344] [2020-01-16 18:11:14,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:14,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:14,195 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:11:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:14,346 INFO L93 Difference]: Finished difference Result 1241 states and 4382 transitions. [2020-01-16 18:11:14,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:14,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:14,349 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:11:14,349 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:11:14,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:11:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-01-16 18:11:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:11:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-01-16 18:11:14,370 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-01-16 18:11:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:14,371 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-01-16 18:11:14,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-01-16 18:11:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:14,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:14,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:14,372 INFO L426 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2088031497, now seen corresponding path program 796 times [2020-01-16 18:11:14,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:14,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136068761] [2020-01-16 18:11:14,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:14,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136068761] [2020-01-16 18:11:14,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:14,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:14,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021734669] [2020-01-16 18:11:14,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:14,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:14,798 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-01-16 18:11:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:14,952 INFO L93 Difference]: Finished difference Result 1244 states and 4384 transitions. [2020-01-16 18:11:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:14,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:14,955 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:11:14,956 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:11:14,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:11:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-01-16 18:11:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:11:14,977 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:14,977 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:11:14,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:11:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:14,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:14,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:14,978 INFO L426 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 934620027, now seen corresponding path program 797 times [2020-01-16 18:11:14,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:14,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5928690] [2020-01-16 18:11:14,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:15,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5928690] [2020-01-16 18:11:15,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:15,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:15,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435877564] [2020-01-16 18:11:15,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:15,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:15,414 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:15,585 INFO L93 Difference]: Finished difference Result 1238 states and 4372 transitions. [2020-01-16 18:11:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:15,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:15,589 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:11:15,589 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:11:15,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:11:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:11:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:11:15,610 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:11:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:15,610 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:11:15,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:11:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:15,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:15,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] [2020-01-16 18:11:15,611 INFO L426 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1749406311, now seen corresponding path program 798 times [2020-01-16 18:11:15,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:15,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080783295] [2020-01-16 18:11:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:16,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-01-16 18:11:16,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080783295] [2020-01-16 18:11:16,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:16,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:16,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528709243] [2020-01-16 18:11:16,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:16,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:16,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:16,043 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:11:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:16,217 INFO L93 Difference]: Finished difference Result 1242 states and 4377 transitions. [2020-01-16 18:11:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:16,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:16,220 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:11:16,221 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:11:16,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:11:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-01-16 18:11:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:11:16,243 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:11:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:16,243 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:11:16,243 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:11:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:16,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:16,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:16,245 INFO L426 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1132841827, now seen corresponding path program 799 times [2020-01-16 18:11:16,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:16,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948411684] [2020-01-16 18:11:16,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:16,683 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:11:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:16,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948411684] [2020-01-16 18:11:16,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:16,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:16,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409691629] [2020-01-16 18:11:16,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:16,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:16,689 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:11:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:16,857 INFO L93 Difference]: Finished difference Result 1234 states and 4367 transitions. [2020-01-16 18:11:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:16,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:16,861 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:11:16,861 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:11:16,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:11:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-01-16 18:11:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:11:16,883 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:11:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:16,883 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:11:16,883 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:11:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:16,884 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:16,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:16,884 INFO L426 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:16,884 INFO L82 PathProgramCache]: Analyzing trace with hash -152087109, now seen corresponding path program 800 times [2020-01-16 18:11:16,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:16,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479589645] [2020-01-16 18:11:16,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:17,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-01-16 18:11:17,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479589645] [2020-01-16 18:11:17,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:17,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:17,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706466840] [2020-01-16 18:11:17,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:17,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:17,328 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:11:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:17,512 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-01-16 18:11:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:17,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:17,515 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:11:17,516 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:11:17,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:11:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:11:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:11:17,537 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:17,537 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:11:17,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:11:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:17,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:17,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:17,538 INFO L426 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1575740967, now seen corresponding path program 801 times [2020-01-16 18:11:17,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:17,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127612669] [2020-01-16 18:11:17,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:17,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-01-16 18:11:17,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127612669] [2020-01-16 18:11:17,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:17,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:17,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199294835] [2020-01-16 18:11:17,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:17,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:17,979 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:18,147 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-01-16 18:11:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:18,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:18,150 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:11:18,151 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:11:18,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:11:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 782. [2020-01-16 18:11:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:11:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3112 transitions. [2020-01-16 18:11:18,172 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3112 transitions. Word has length 25 [2020-01-16 18:11:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:18,172 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3112 transitions. [2020-01-16 18:11:18,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3112 transitions. [2020-01-16 18:11:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:18,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:18,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] [2020-01-16 18:11:18,173 INFO L426 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash -573980041, now seen corresponding path program 802 times [2020-01-16 18:11:18,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:18,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871074400] [2020-01-16 18:11:18,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:18,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871074400] [2020-01-16 18:11:18,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:18,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:18,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945776152] [2020-01-16 18:11:18,612 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:18,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:18,612 INFO L87 Difference]: Start difference. First operand 782 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:11:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:18,779 INFO L93 Difference]: Finished difference Result 1238 states and 4369 transitions. [2020-01-16 18:11:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:18,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:18,782 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:11:18,783 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:11:18,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:11:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:11:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:11:18,804 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:18,804 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:11:18,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:11:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:18,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:18,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:18,806 INFO L426 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash 837730525, now seen corresponding path program 803 times [2020-01-16 18:11:18,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:18,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973092202] [2020-01-16 18:11:18,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:19,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973092202] [2020-01-16 18:11:19,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:19,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:19,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316934354] [2020-01-16 18:11:19,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:19,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:19,269 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:19,440 INFO L93 Difference]: Finished difference Result 1234 states and 4361 transitions. [2020-01-16 18:11:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:19,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:19,444 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:11:19,444 INFO L226 Difference]: Without dead ends: 1222 [2020-01-16 18:11:19,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-01-16 18:11:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 781. [2020-01-16 18:11:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:11:19,466 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:11:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:19,466 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:11:19,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:11:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:19,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:19,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:19,468 INFO L426 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash -235354855, now seen corresponding path program 804 times [2020-01-16 18:11:19,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:19,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979282156] [2020-01-16 18:11:19,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:19,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979282156] [2020-01-16 18:11:19,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:19,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:19,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48307630] [2020-01-16 18:11:19,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:19,900 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:11:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:20,063 INFO L93 Difference]: Finished difference Result 1236 states and 4362 transitions. [2020-01-16 18:11:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:20,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:20,067 INFO L225 Difference]: With dead ends: 1236 [2020-01-16 18:11:20,067 INFO L226 Difference]: Without dead ends: 1216 [2020-01-16 18:11:20,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-01-16 18:11:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 775. [2020-01-16 18:11:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:11:20,088 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:11:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:20,088 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:11:20,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:11:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:20,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:20,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:20,089 INFO L426 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash 370706525, now seen corresponding path program 805 times [2020-01-16 18:11:20,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:20,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289537956] [2020-01-16 18:11:20,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:20,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289537956] [2020-01-16 18:11:20,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:20,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:20,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709158866] [2020-01-16 18:11:20,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:20,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:20,511 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:11:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:20,669 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-01-16 18:11:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:20,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:20,672 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:11:20,672 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:11:20,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:11:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-01-16 18:11:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:11:20,693 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:20,693 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:11:20,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:11:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:20,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:20,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] [2020-01-16 18:11:20,695 INFO L426 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1361964347, now seen corresponding path program 806 times [2020-01-16 18:11:20,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:20,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881580477] [2020-01-16 18:11:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:21,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-01-16 18:11:21,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881580477] [2020-01-16 18:11:21,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:21,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:21,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089703122] [2020-01-16 18:11:21,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:21,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:21,125 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:21,291 INFO L93 Difference]: Finished difference Result 1250 states and 4398 transitions. [2020-01-16 18:11:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:21,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:21,294 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:11:21,294 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:11:21,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:11:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-01-16 18:11:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:11:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:11:21,316 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:21,317 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:11:21,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:11:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:21,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:21,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:21,318 INFO L426 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1998226693, now seen corresponding path program 807 times [2020-01-16 18:11:21,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:21,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485933441] [2020-01-16 18:11:21,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:21,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485933441] [2020-01-16 18:11:21,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:21,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:21,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460721196] [2020-01-16 18:11:21,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:21,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:21,757 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:21,929 INFO L93 Difference]: Finished difference Result 1245 states and 4388 transitions. [2020-01-16 18:11:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:21,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:21,932 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:11:21,933 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:11:21,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:11:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:11:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:11:21,955 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:11:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:21,955 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:11:21,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:11:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:21,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:21,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] [2020-01-16 18:11:21,956 INFO L426 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -996465767, now seen corresponding path program 808 times [2020-01-16 18:11:21,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:21,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602094405] [2020-01-16 18:11:21,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:22,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602094405] [2020-01-16 18:11:22,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:22,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:22,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139486961] [2020-01-16 18:11:22,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:22,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:22,396 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:11:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:22,566 INFO L93 Difference]: Finished difference Result 1246 states and 4386 transitions. [2020-01-16 18:11:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:22,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:22,570 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:11:22,570 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:11:22,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:11:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-01-16 18:11:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:11:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-01-16 18:11:22,592 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-01-16 18:11:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:22,592 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-01-16 18:11:22,592 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-01-16 18:11:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:22,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:22,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:22,593 INFO L426 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1943185315, now seen corresponding path program 809 times [2020-01-16 18:11:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:22,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403466558] [2020-01-16 18:11:22,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:23,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403466558] [2020-01-16 18:11:23,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:23,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806001303] [2020-01-16 18:11:23,011 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:23,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:23,012 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:11:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:23,175 INFO L93 Difference]: Finished difference Result 1252 states and 4399 transitions. [2020-01-16 18:11:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:23,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:23,179 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:11:23,179 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:11:23,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:11:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 784. [2020-01-16 18:11:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-01-16 18:11:23,200 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-01-16 18:11:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:23,200 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-01-16 18:11:23,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-01-16 18:11:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:23,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:23,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:23,201 INFO L426 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -332244357, now seen corresponding path program 810 times [2020-01-16 18:11:23,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:23,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975933904] [2020-01-16 18:11:23,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:23,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975933904] [2020-01-16 18:11:23,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:23,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:23,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801676995] [2020-01-16 18:11:23,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:23,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:23,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:23,628 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:11:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:23,800 INFO L93 Difference]: Finished difference Result 1250 states and 4390 transitions. [2020-01-16 18:11:23,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:23,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:23,803 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:11:23,803 INFO L226 Difference]: Without dead ends: 1227 [2020-01-16 18:11:23,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-01-16 18:11:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 775. [2020-01-16 18:11:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:11:23,825 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:11:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:23,825 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:11:23,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:11:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:23,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:23,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:23,826 INFO L426 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1554195609, now seen corresponding path program 811 times [2020-01-16 18:11:23,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:23,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972166284] [2020-01-16 18:11:23,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972166284] [2020-01-16 18:11:24,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:24,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:24,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207208262] [2020-01-16 18:11:24,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:24,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:24,241 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:11:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:24,396 INFO L93 Difference]: Finished difference Result 1240 states and 4374 transitions. [2020-01-16 18:11:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:24,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:24,399 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:11:24,400 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:11:24,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:11:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-01-16 18:11:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:11:24,421 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:11:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:24,421 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:11:24,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:11:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:24,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:24,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:24,422 INFO L426 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1129830729, now seen corresponding path program 812 times [2020-01-16 18:11:24,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819923087] [2020-01-16 18:11:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:24,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-01-16 18:11:24,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819923087] [2020-01-16 18:11:24,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:24,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:24,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63037674] [2020-01-16 18:11:24,840 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:24,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:24,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:24,841 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:11:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:25,030 INFO L93 Difference]: Finished difference Result 1244 states and 4379 transitions. [2020-01-16 18:11:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:25,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:25,034 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:11:25,034 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:11:25,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:11:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 778. [2020-01-16 18:11:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-01-16 18:11:25,055 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-01-16 18:11:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:25,055 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-01-16 18:11:25,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-01-16 18:11:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:25,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:25,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:25,056 INFO L426 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -46242245, now seen corresponding path program 813 times [2020-01-16 18:11:25,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:25,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503871258] [2020-01-16 18:11:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:25,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503871258] [2020-01-16 18:11:25,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:25,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:25,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406281309] [2020-01-16 18:11:25,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:25,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:25,482 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:11:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:25,665 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-01-16 18:11:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:25,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:25,669 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:11:25,669 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:11:25,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:11:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-01-16 18:11:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:11:25,691 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:11:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:25,691 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:11:25,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:11:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:25,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:25,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:25,692 INFO L426 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1119327625, now seen corresponding path program 814 times [2020-01-16 18:11:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:25,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850596080] [2020-01-16 18:11:25,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850596080] [2020-01-16 18:11:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:26,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180754852] [2020-01-16 18:11:26,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:26,118 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:11:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:26,302 INFO L93 Difference]: Finished difference Result 1240 states and 4368 transitions. [2020-01-16 18:11:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:26,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:26,306 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:11:26,306 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:11:26,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:11:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 778. [2020-01-16 18:11:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:11:26,326 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:11:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:26,326 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:11:26,326 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:11:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:26,327 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:26,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:26,327 INFO L426 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash -35739141, now seen corresponding path program 815 times [2020-01-16 18:11:26,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:26,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137214739] [2020-01-16 18:11:26,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:26,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137214739] [2020-01-16 18:11:26,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:26,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:26,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815703112] [2020-01-16 18:11:26,754 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:26,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:26,754 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:11:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:26,937 INFO L93 Difference]: Finished difference Result 1248 states and 4386 transitions. [2020-01-16 18:11:26,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:26,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:26,940 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:11:26,941 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:11:26,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:11:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:11:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-01-16 18:11:26,961 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:26,961 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-01-16 18:11:26,961 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-01-16 18:11:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:26,962 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:26,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:26,963 INFO L426 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:26,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1575201817, now seen corresponding path program 816 times [2020-01-16 18:11:26,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:26,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653160392] [2020-01-16 18:11:26,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:27,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653160392] [2020-01-16 18:11:27,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:27,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:27,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031051936] [2020-01-16 18:11:27,392 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:27,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:27,392 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:27,590 INFO L93 Difference]: Finished difference Result 1246 states and 4377 transitions. [2020-01-16 18:11:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:27,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:27,594 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:11:27,594 INFO L226 Difference]: Without dead ends: 1221 [2020-01-16 18:11:27,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-01-16 18:11:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 772. [2020-01-16 18:11:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-01-16 18:11:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3083 transitions. [2020-01-16 18:11:27,616 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3083 transitions. Word has length 25 [2020-01-16 18:11:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:27,616 INFO L478 AbstractCegarLoop]: Abstraction has 772 states and 3083 transitions. [2020-01-16 18:11:27,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3083 transitions. [2020-01-16 18:11:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:27,617 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:27,617 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:27,617 INFO L426 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1296926015, now seen corresponding path program 817 times [2020-01-16 18:11:27,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:27,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313297312] [2020-01-16 18:11:27,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:28,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313297312] [2020-01-16 18:11:28,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:28,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:28,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652622255] [2020-01-16 18:11:28,052 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:28,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:28,053 INFO L87 Difference]: Start difference. First operand 772 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:11:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:28,226 INFO L93 Difference]: Finished difference Result 1250 states and 4406 transitions. [2020-01-16 18:11:28,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:28,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:28,230 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:11:28,230 INFO L226 Difference]: Without dead ends: 1235 [2020-01-16 18:11:28,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2020-01-16 18:11:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 781. [2020-01-16 18:11:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-01-16 18:11:28,252 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-01-16 18:11:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:28,252 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-01-16 18:11:28,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-01-16 18:11:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:28,254 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:28,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:28,254 INFO L426 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1387100323, now seen corresponding path program 818 times [2020-01-16 18:11:28,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:28,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930273204] [2020-01-16 18:11:28,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:28,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930273204] [2020-01-16 18:11:28,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:28,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:28,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040110130] [2020-01-16 18:11:28,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:28,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:28,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:28,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:28,682 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:11:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:28,828 INFO L93 Difference]: Finished difference Result 1247 states and 4397 transitions. [2020-01-16 18:11:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:28,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:28,832 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:11:28,832 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:11:28,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:11:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-01-16 18:11:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:11:28,854 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:28,854 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:11:28,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:11:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:28,855 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:28,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:28,855 INFO L426 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash -303511839, now seen corresponding path program 819 times [2020-01-16 18:11:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115338757] [2020-01-16 18:11:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:29,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115338757] [2020-01-16 18:11:29,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:29,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:29,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637433873] [2020-01-16 18:11:29,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:29,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:29,287 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:29,434 INFO L93 Difference]: Finished difference Result 1257 states and 4420 transitions. [2020-01-16 18:11:29,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:29,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:29,437 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:11:29,438 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:11:29,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:11:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 784. [2020-01-16 18:11:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-01-16 18:11:29,459 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:29,459 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-01-16 18:11:29,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-01-16 18:11:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:29,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:29,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:29,461 INFO L426 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1376597219, now seen corresponding path program 820 times [2020-01-16 18:11:29,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:29,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755111043] [2020-01-16 18:11:29,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:29,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755111043] [2020-01-16 18:11:29,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991234842] [2020-01-16 18:11:29,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:29,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:29,902 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:30,092 INFO L93 Difference]: Finished difference Result 1258 states and 4416 transitions. [2020-01-16 18:11:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:30,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:30,096 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:11:30,096 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:11:30,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:11:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 778. [2020-01-16 18:11:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:11:30,117 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:30,117 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:11:30,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:11:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:30,118 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:30,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:30,119 INFO L426 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash -293008735, now seen corresponding path program 821 times [2020-01-16 18:11:30,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082152412] [2020-01-16 18:11:30,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082152412] [2020-01-16 18:11:30,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:30,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:30,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564372335] [2020-01-16 18:11:30,547 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:30,547 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:30,699 INFO L93 Difference]: Finished difference Result 1248 states and 4396 transitions. [2020-01-16 18:11:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:30,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:30,703 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:11:30,703 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:11:30,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:11:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 781. [2020-01-16 18:11:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-01-16 18:11:30,724 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-01-16 18:11:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:30,724 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-01-16 18:11:30,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-01-16 18:11:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:30,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:30,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:30,725 INFO L426 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1317932223, now seen corresponding path program 822 times [2020-01-16 18:11:30,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:30,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461130830] [2020-01-16 18:11:30,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:31,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461130830] [2020-01-16 18:11:31,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:31,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:31,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518921140] [2020-01-16 18:11:31,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:31,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:31,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:31,164 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:11:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:31,344 INFO L93 Difference]: Finished difference Result 1252 states and 4401 transitions. [2020-01-16 18:11:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:31,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:31,348 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:11:31,348 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:11:31,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:11:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 775. [2020-01-16 18:11:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:11:31,368 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:11:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:31,368 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:11:31,368 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:11:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:31,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:31,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:31,369 INFO L426 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:31,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1072007203, now seen corresponding path program 823 times [2020-01-16 18:11:31,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:31,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472783886] [2020-01-16 18:11:31,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:31,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472783886] [2020-01-16 18:11:31,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:31,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:31,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154860965] [2020-01-16 18:11:31,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:31,798 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:11:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:31,956 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-01-16 18:11:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:31,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:31,960 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:11:31,960 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:11:31,960 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:11:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:11:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:11:31,981 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:11:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:31,981 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:11:31,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:11:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:31,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:31,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] [2020-01-16 18:11:31,982 INFO L426 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash 538933755, now seen corresponding path program 824 times [2020-01-16 18:11:31,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:31,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503254376] [2020-01-16 18:11:31,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:32,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503254376] [2020-01-16 18:11:32,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:32,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:32,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072763213] [2020-01-16 18:11:32,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:32,416 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:11:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:32,582 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-01-16 18:11:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:32,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:32,586 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:11:32,586 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:11:32,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:11:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-01-16 18:11:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:11:32,610 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:32,610 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:11:32,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:11:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:32,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:32,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:32,622 INFO L426 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 22084385, now seen corresponding path program 825 times [2020-01-16 18:11:32,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:32,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859012248] [2020-01-16 18:11:32,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:33,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-01-16 18:11:33,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859012248] [2020-01-16 18:11:33,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:33,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:33,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591901743] [2020-01-16 18:11:33,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:33,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:33,054 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:33,208 INFO L93 Difference]: Finished difference Result 1251 states and 4403 transitions. [2020-01-16 18:11:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:33,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:33,212 INFO L225 Difference]: With dead ends: 1251 [2020-01-16 18:11:33,212 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:11:33,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:11:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 783. [2020-01-16 18:11:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-01-16 18:11:33,233 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:33,233 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-01-16 18:11:33,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-01-16 18:11:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:33,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:33,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:33,234 INFO L426 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash 559939963, now seen corresponding path program 826 times [2020-01-16 18:11:33,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:33,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111596668] [2020-01-16 18:11:33,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:33,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111596668] [2020-01-16 18:11:33,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:33,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:33,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462771328] [2020-01-16 18:11:33,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:33,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:33,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:33,666 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:33,820 INFO L93 Difference]: Finished difference Result 1250 states and 4396 transitions. [2020-01-16 18:11:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:33,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:33,824 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:11:33,824 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:11:33,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:11:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-01-16 18:11:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-01-16 18:11:33,845 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-01-16 18:11:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:33,845 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-01-16 18:11:33,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-01-16 18:11:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:33,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:33,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:33,846 INFO L426 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 32587489, now seen corresponding path program 827 times [2020-01-16 18:11:33,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:33,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225094548] [2020-01-16 18:11:33,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:34,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225094548] [2020-01-16 18:11:34,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:34,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:34,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551577468] [2020-01-16 18:11:34,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:34,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:34,281 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:11:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:34,435 INFO L93 Difference]: Finished difference Result 1243 states and 4382 transitions. [2020-01-16 18:11:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:34,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:34,439 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:11:34,439 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:11:34,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:11:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-01-16 18:11:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:11:34,460 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:11:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:34,461 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:11:34,461 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:11:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:34,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:34,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:34,462 INFO L426 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:34,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1040497891, now seen corresponding path program 828 times [2020-01-16 18:11:34,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:34,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270485118] [2020-01-16 18:11:34,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:34,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-01-16 18:11:34,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270485118] [2020-01-16 18:11:34,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:34,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:34,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254740404] [2020-01-16 18:11:34,887 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:34,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:34,887 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:11:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:35,044 INFO L93 Difference]: Finished difference Result 1245 states and 4383 transitions. [2020-01-16 18:11:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:35,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:35,048 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:11:35,048 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:11:35,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:11:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-01-16 18:11:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:11:35,069 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:11:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:35,069 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:11:35,069 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:11:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:35,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:35,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:35,070 INFO L426 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -746410979, now seen corresponding path program 829 times [2020-01-16 18:11:35,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:35,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096367149] [2020-01-16 18:11:35,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:35,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-01-16 18:11:35,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096367149] [2020-01-16 18:11:35,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:35,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:35,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152393573] [2020-01-16 18:11:35,519 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:35,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:35,520 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:11:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:35,723 INFO L93 Difference]: Finished difference Result 1265 states and 4441 transitions. [2020-01-16 18:11:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:35,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:35,727 INFO L225 Difference]: With dead ends: 1265 [2020-01-16 18:11:35,727 INFO L226 Difference]: Without dead ends: 1250 [2020-01-16 18:11:35,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-01-16 18:11:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 786. [2020-01-16 18:11:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:11:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3121 transitions. [2020-01-16 18:11:35,749 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3121 transitions. Word has length 25 [2020-01-16 18:11:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:35,749 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3121 transitions. [2020-01-16 18:11:35,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3121 transitions. [2020-01-16 18:11:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:35,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:35,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:35,750 INFO L426 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1819496359, now seen corresponding path program 830 times [2020-01-16 18:11:35,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:35,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729575297] [2020-01-16 18:11:35,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:36,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729575297] [2020-01-16 18:11:36,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:36,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:36,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58752604] [2020-01-16 18:11:36,196 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:36,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:36,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:36,196 INFO L87 Difference]: Start difference. First operand 786 states and 3121 transitions. Second operand 10 states. [2020-01-16 18:11:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:36,401 INFO L93 Difference]: Finished difference Result 1266 states and 4437 transitions. [2020-01-16 18:11:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:36,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:36,405 INFO L225 Difference]: With dead ends: 1266 [2020-01-16 18:11:36,405 INFO L226 Difference]: Without dead ends: 1244 [2020-01-16 18:11:36,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-01-16 18:11:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-01-16 18:11:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:11:36,427 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:36,427 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:11:36,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:11:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:36,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:36,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:36,429 INFO L426 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:36,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1948118463, now seen corresponding path program 831 times [2020-01-16 18:11:36,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:36,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436976111] [2020-01-16 18:11:36,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:36,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436976111] [2020-01-16 18:11:36,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:36,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:36,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434310143] [2020-01-16 18:11:36,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:36,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:36,868 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:37,025 INFO L93 Difference]: Finished difference Result 1262 states and 4429 transitions. [2020-01-16 18:11:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:37,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:37,028 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:11:37,029 INFO L226 Difference]: Without dead ends: 1247 [2020-01-16 18:11:37,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-01-16 18:11:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 785. [2020-01-16 18:11:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:11:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3114 transitions. [2020-01-16 18:11:37,050 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3114 transitions. Word has length 25 [2020-01-16 18:11:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:37,050 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3114 transitions. [2020-01-16 18:11:37,050 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3114 transitions. [2020-01-16 18:11:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:37,051 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:37,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:37,052 INFO L426 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1808993255, now seen corresponding path program 832 times [2020-01-16 18:11:37,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:37,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441737574] [2020-01-16 18:11:37,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:37,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-01-16 18:11:37,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441737574] [2020-01-16 18:11:37,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:37,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:37,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651636992] [2020-01-16 18:11:37,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:37,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:37,491 INFO L87 Difference]: Start difference. First operand 785 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:11:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:37,699 INFO L93 Difference]: Finished difference Result 1261 states and 4422 transitions. [2020-01-16 18:11:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:37,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:37,703 INFO L225 Difference]: With dead ends: 1261 [2020-01-16 18:11:37,703 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:11:37,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:11:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-01-16 18:11:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:11:37,724 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:11:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:37,724 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:11:37,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:11:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:37,726 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:37,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:37,726 INFO L426 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1969124671, now seen corresponding path program 833 times [2020-01-16 18:11:37,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:37,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668567214] [2020-01-16 18:11:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:38,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668567214] [2020-01-16 18:11:38,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:38,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:38,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712433279] [2020-01-16 18:11:38,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:38,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:38,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:38,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:38,178 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:11:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:38,357 INFO L93 Difference]: Finished difference Result 1264 states and 4428 transitions. [2020-01-16 18:11:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:38,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:38,361 INFO L225 Difference]: With dead ends: 1264 [2020-01-16 18:11:38,361 INFO L226 Difference]: Without dead ends: 1248 [2020-01-16 18:11:38,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-01-16 18:11:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-01-16 18:11:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:11:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3109 transitions. [2020-01-16 18:11:38,382 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3109 transitions. Word has length 25 [2020-01-16 18:11:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:38,383 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3109 transitions. [2020-01-16 18:11:38,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3109 transitions. [2020-01-16 18:11:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:38,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:38,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:38,384 INFO L426 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash -714901667, now seen corresponding path program 834 times [2020-01-16 18:11:38,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:38,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507799717] [2020-01-16 18:11:38,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:38,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507799717] [2020-01-16 18:11:38,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:38,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:38,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317104877] [2020-01-16 18:11:38,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:38,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:38,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:38,816 INFO L87 Difference]: Start difference. First operand 785 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:11:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:39,024 INFO L93 Difference]: Finished difference Result 1262 states and 4419 transitions. [2020-01-16 18:11:39,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:39,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:39,027 INFO L225 Difference]: With dead ends: 1262 [2020-01-16 18:11:39,027 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:11:39,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:11:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 775. [2020-01-16 18:11:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:11:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3088 transitions. [2020-01-16 18:11:39,049 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3088 transitions. Word has length 25 [2020-01-16 18:11:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:39,049 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3088 transitions. [2020-01-16 18:11:39,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3088 transitions. [2020-01-16 18:11:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:39,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:39,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:39,050 INFO L426 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1190126203, now seen corresponding path program 835 times [2020-01-16 18:11:39,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:39,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647351359] [2020-01-16 18:11:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:39,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647351359] [2020-01-16 18:11:39,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:39,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:39,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636243416] [2020-01-16 18:11:39,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:39,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:39,467 INFO L87 Difference]: Start difference. First operand 775 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:11:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:39,670 INFO L93 Difference]: Finished difference Result 1246 states and 4388 transitions. [2020-01-16 18:11:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:39,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:39,674 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:11:39,674 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:11:39,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:11:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 781. [2020-01-16 18:11:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:11:39,696 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:11:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:39,696 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:11:39,696 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:11:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:39,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:39,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:39,697 INFO L426 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1493900135, now seen corresponding path program 836 times [2020-01-16 18:11:39,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:39,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385942512] [2020-01-16 18:11:39,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:40,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385942512] [2020-01-16 18:11:40,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:40,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:40,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71292645] [2020-01-16 18:11:40,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:40,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:40,118 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:11:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:40,318 INFO L93 Difference]: Finished difference Result 1250 states and 4393 transitions. [2020-01-16 18:11:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:40,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:40,322 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:11:40,322 INFO L226 Difference]: Without dead ends: 1231 [2020-01-16 18:11:40,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-01-16 18:11:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-01-16 18:11:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:11:40,343 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:11:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:40,343 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:11:40,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:11:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:40,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:40,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:40,344 INFO L426 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -410311651, now seen corresponding path program 837 times [2020-01-16 18:11:40,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:40,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702655507] [2020-01-16 18:11:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:40,781 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-01-16 18:11:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:40,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702655507] [2020-01-16 18:11:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906818336] [2020-01-16 18:11:40,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:40,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:40,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:40,787 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:11:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:40,996 INFO L93 Difference]: Finished difference Result 1244 states and 4381 transitions. [2020-01-16 18:11:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:40,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:40,999 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:11:41,000 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:11:41,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:11:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-01-16 18:11:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-01-16 18:11:41,021 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-01-16 18:11:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:41,021 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-01-16 18:11:41,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-01-16 18:11:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:41,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:41,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:41,022 INFO L426 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1483397031, now seen corresponding path program 838 times [2020-01-16 18:11:41,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:41,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619227660] [2020-01-16 18:11:41,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:41,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619227660] [2020-01-16 18:11:41,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:41,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:41,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319498337] [2020-01-16 18:11:41,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:41,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:41,442 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:11:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:41,651 INFO L93 Difference]: Finished difference Result 1246 states and 4382 transitions. [2020-01-16 18:11:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:41,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:41,655 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:11:41,655 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:11:41,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:11:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-01-16 18:11:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-01-16 18:11:41,676 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-01-16 18:11:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:41,676 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-01-16 18:11:41,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-01-16 18:11:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:41,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:41,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] [2020-01-16 18:11:41,678 INFO L426 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -399808547, now seen corresponding path program 839 times [2020-01-16 18:11:41,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:41,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138172439] [2020-01-16 18:11:41,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:42,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138172439] [2020-01-16 18:11:42,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:42,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:42,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286805695] [2020-01-16 18:11:42,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:42,102 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:11:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:42,313 INFO L93 Difference]: Finished difference Result 1254 states and 4400 transitions. [2020-01-16 18:11:42,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:42,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:42,317 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:11:42,317 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:11:42,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:11:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-01-16 18:11:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-01-16 18:11:42,339 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:42,339 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-01-16 18:11:42,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-01-16 18:11:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:42,340 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:42,340 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:42,340 INFO L426 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1211132411, now seen corresponding path program 840 times [2020-01-16 18:11:42,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:42,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584021221] [2020-01-16 18:11:42,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:42,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584021221] [2020-01-16 18:11:42,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:42,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:42,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203195593] [2020-01-16 18:11:42,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:42,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:42,758 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:42,968 INFO L93 Difference]: Finished difference Result 1252 states and 4391 transitions. [2020-01-16 18:11:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:42,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:42,972 INFO L225 Difference]: With dead ends: 1252 [2020-01-16 18:11:42,972 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:11:42,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:11:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 769. [2020-01-16 18:11:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:11:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3076 transitions. [2020-01-16 18:11:42,993 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3076 transitions. Word has length 25 [2020-01-16 18:11:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:42,993 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3076 transitions. [2020-01-16 18:11:42,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3076 transitions. [2020-01-16 18:11:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:42,995 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:42,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:42,995 INFO L426 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1423698301, now seen corresponding path program 841 times [2020-01-16 18:11:42,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:42,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881717660] [2020-01-16 18:11:42,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:43,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881717660] [2020-01-16 18:11:43,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:43,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:43,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190017435] [2020-01-16 18:11:43,406 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:43,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:43,406 INFO L87 Difference]: Start difference. First operand 769 states and 3076 transitions. Second operand 10 states. [2020-01-16 18:11:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:43,623 INFO L93 Difference]: Finished difference Result 1213 states and 4289 transitions. [2020-01-16 18:11:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:43,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:43,627 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:11:43,627 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:11:43,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:11:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 781. [2020-01-16 18:11:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-01-16 18:11:43,648 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-01-16 18:11:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:43,649 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-01-16 18:11:43,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-01-16 18:11:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:43,650 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:43,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:43,650 INFO L426 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -453446687, now seen corresponding path program 842 times [2020-01-16 18:11:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:43,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001842435] [2020-01-16 18:11:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:44,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001842435] [2020-01-16 18:11:44,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:44,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:44,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060633949] [2020-01-16 18:11:44,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:44,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:44,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:44,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:44,066 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-01-16 18:11:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:44,236 INFO L93 Difference]: Finished difference Result 1215 states and 4289 transitions. [2020-01-16 18:11:44,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:44,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:44,239 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:11:44,239 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:11:44,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:11:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:11:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3109 transitions. [2020-01-16 18:11:44,260 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3109 transitions. Word has length 25 [2020-01-16 18:11:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:44,260 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3109 transitions. [2020-01-16 18:11:44,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3109 transitions. [2020-01-16 18:11:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:44,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:44,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:44,262 INFO L426 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:44,262 INFO L82 PathProgramCache]: Analyzing trace with hash 502335777, now seen corresponding path program 843 times [2020-01-16 18:11:44,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:44,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44750515] [2020-01-16 18:11:44,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:44,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44750515] [2020-01-16 18:11:44,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:44,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:44,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011067172] [2020-01-16 18:11:44,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:44,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:44,683 INFO L87 Difference]: Start difference. First operand 777 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:11:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:44,894 INFO L93 Difference]: Finished difference Result 1209 states and 4277 transitions. [2020-01-16 18:11:44,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:44,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:44,897 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:11:44,898 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:11:44,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:11:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-01-16 18:11:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3114 transitions. [2020-01-16 18:11:44,919 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3114 transitions. Word has length 25 [2020-01-16 18:11:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:44,919 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3114 transitions. [2020-01-16 18:11:44,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3114 transitions. [2020-01-16 18:11:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:44,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:44,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:44,920 INFO L426 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1483090495, now seen corresponding path program 844 times [2020-01-16 18:11:44,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:44,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748103786] [2020-01-16 18:11:44,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:45,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748103786] [2020-01-16 18:11:45,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9620708] [2020-01-16 18:11:45,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:45,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:45,339 INFO L87 Difference]: Start difference. First operand 780 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:11:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:45,550 INFO L93 Difference]: Finished difference Result 1208 states and 4272 transitions. [2020-01-16 18:11:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:45,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:45,554 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:11:45,554 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:11:45,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:11:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:11:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3106 transitions. [2020-01-16 18:11:45,575 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3106 transitions. Word has length 25 [2020-01-16 18:11:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:45,576 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3106 transitions. [2020-01-16 18:11:45,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3106 transitions. [2020-01-16 18:11:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:45,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:45,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:45,577 INFO L426 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -114821501, now seen corresponding path program 845 times [2020-01-16 18:11:45,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:45,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67823626] [2020-01-16 18:11:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:45,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-01-16 18:11:45,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67823626] [2020-01-16 18:11:45,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:45,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:45,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729784215] [2020-01-16 18:11:45,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:45,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:45,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:45,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:45,993 INFO L87 Difference]: Start difference. First operand 777 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:11:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:46,159 INFO L93 Difference]: Finished difference Result 1213 states and 4282 transitions. [2020-01-16 18:11:46,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:46,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:46,162 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:11:46,162 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:11:46,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:11:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-01-16 18:11:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:11:46,183 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:46,183 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:11:46,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:11:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:46,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:46,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:46,184 INFO L426 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1496119457, now seen corresponding path program 846 times [2020-01-16 18:11:46,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:46,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534249497] [2020-01-16 18:11:46,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:46,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534249497] [2020-01-16 18:11:46,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:46,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:46,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285019393] [2020-01-16 18:11:46,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:46,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:46,615 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:46,782 INFO L93 Difference]: Finished difference Result 1210 states and 4273 transitions. [2020-01-16 18:11:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:46,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:46,785 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:11:46,786 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:11:46,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:11:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 774. [2020-01-16 18:11:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:11:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3098 transitions. [2020-01-16 18:11:46,807 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3098 transitions. Word has length 25 [2020-01-16 18:11:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:46,807 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3098 transitions. [2020-01-16 18:11:46,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3098 transitions. [2020-01-16 18:11:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:46,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:46,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:46,808 INFO L426 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1846184027, now seen corresponding path program 847 times [2020-01-16 18:11:46,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:46,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915624086] [2020-01-16 18:11:46,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:47,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915624086] [2020-01-16 18:11:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:47,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:47,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868519933] [2020-01-16 18:11:47,227 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:47,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:47,227 INFO L87 Difference]: Start difference. First operand 774 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:11:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:47,398 INFO L93 Difference]: Finished difference Result 1222 states and 4310 transitions. [2020-01-16 18:11:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:47,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:47,402 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:11:47,402 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:11:47,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:11:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-01-16 18:11:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:11:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3120 transitions. [2020-01-16 18:11:47,425 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3120 transitions. Word has length 25 [2020-01-16 18:11:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:47,425 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3120 transitions. [2020-01-16 18:11:47,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3120 transitions. [2020-01-16 18:11:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:47,426 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:47,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:47,426 INFO L426 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash -875932413, now seen corresponding path program 848 times [2020-01-16 18:11:47,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:47,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197005293] [2020-01-16 18:11:47,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:47,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-01-16 18:11:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197005293] [2020-01-16 18:11:47,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:47,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:47,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293928574] [2020-01-16 18:11:47,841 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:47,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:47,841 INFO L87 Difference]: Start difference. First operand 782 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:11:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:47,999 INFO L93 Difference]: Finished difference Result 1224 states and 4310 transitions. [2020-01-16 18:11:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:47,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:48,002 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:11:48,002 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:11:48,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:11:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 778. [2020-01-16 18:11:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3109 transitions. [2020-01-16 18:11:48,023 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3109 transitions. Word has length 25 [2020-01-16 18:11:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:48,024 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3109 transitions. [2020-01-16 18:11:48,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3109 transitions. [2020-01-16 18:11:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:48,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:48,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:48,025 INFO L426 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2005884129, now seen corresponding path program 849 times [2020-01-16 18:11:48,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:48,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850248086] [2020-01-16 18:11:48,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:48,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850248086] [2020-01-16 18:11:48,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:48,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:48,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47060928] [2020-01-16 18:11:48,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:48,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:48,440 INFO L87 Difference]: Start difference. First operand 778 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:11:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:48,650 INFO L93 Difference]: Finished difference Result 1223 states and 4308 transitions. [2020-01-16 18:11:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:48,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:48,654 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:11:48,654 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:11:48,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:11:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 782. [2020-01-16 18:11:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:11:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3116 transitions. [2020-01-16 18:11:48,675 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:48,675 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3116 transitions. [2020-01-16 18:11:48,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3116 transitions. [2020-01-16 18:11:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:48,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:48,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] [2020-01-16 18:11:48,676 INFO L426 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825345, now seen corresponding path program 850 times [2020-01-16 18:11:48,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:48,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579848653] [2020-01-16 18:11:48,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:49,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579848653] [2020-01-16 18:11:49,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:49,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:49,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326300940] [2020-01-16 18:11:49,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:49,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:49,097 INFO L87 Difference]: Start difference. First operand 782 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:49,318 INFO L93 Difference]: Finished difference Result 1226 states and 4310 transitions. [2020-01-16 18:11:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:49,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:49,321 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:11:49,322 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:11:49,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:11:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 778. [2020-01-16 18:11:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:11:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-01-16 18:11:49,344 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:49,344 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-01-16 18:11:49,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-01-16 18:11:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:49,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:49,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:49,346 INFO L426 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -211711003, now seen corresponding path program 851 times [2020-01-16 18:11:49,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:49,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974957515] [2020-01-16 18:11:49,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:49,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974957515] [2020-01-16 18:11:49,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:49,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:49,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541195129] [2020-01-16 18:11:49,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:49,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:49,767 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:49,931 INFO L93 Difference]: Finished difference Result 1229 states and 4318 transitions. [2020-01-16 18:11:49,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:49,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:49,935 INFO L225 Difference]: With dead ends: 1229 [2020-01-16 18:11:49,935 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:11:49,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:11:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 784. [2020-01-16 18:11:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:11:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-01-16 18:11:49,957 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-01-16 18:11:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:49,957 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-01-16 18:11:49,957 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-01-16 18:11:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:49,958 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:49,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:49,958 INFO L426 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1284796383, now seen corresponding path program 852 times [2020-01-16 18:11:49,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:49,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734690663] [2020-01-16 18:11:49,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:50,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734690663] [2020-01-16 18:11:50,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:50,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:50,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008834695] [2020-01-16 18:11:50,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:50,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:50,371 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:11:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:50,520 INFO L93 Difference]: Finished difference Result 1230 states and 4314 transitions. [2020-01-16 18:11:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:50,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:50,524 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:11:50,524 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:11:50,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:11:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 774. [2020-01-16 18:11:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:11:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3095 transitions. [2020-01-16 18:11:50,545 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3095 transitions. Word has length 25 [2020-01-16 18:11:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:50,545 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3095 transitions. [2020-01-16 18:11:50,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3095 transitions. [2020-01-16 18:11:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:50,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:50,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:50,546 INFO L426 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -342635675, now seen corresponding path program 853 times [2020-01-16 18:11:50,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:50,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758679023] [2020-01-16 18:11:50,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:50,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758679023] [2020-01-16 18:11:50,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:50,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:50,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090561231] [2020-01-16 18:11:50,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:50,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:50,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:50,960 INFO L87 Difference]: Start difference. First operand 774 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:11:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:51,114 INFO L93 Difference]: Finished difference Result 1210 states and 4276 transitions. [2020-01-16 18:11:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:51,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:51,117 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:11:51,118 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:11:51,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:11:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 780. [2020-01-16 18:11:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-01-16 18:11:51,138 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:51,138 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-01-16 18:11:51,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-01-16 18:11:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:51,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:51,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:51,139 INFO L426 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 638119043, now seen corresponding path program 854 times [2020-01-16 18:11:51,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:51,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595827101] [2020-01-16 18:11:51,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:51,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595827101] [2020-01-16 18:11:51,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:51,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:51,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404374938] [2020-01-16 18:11:51,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:51,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:51,560 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:51,729 INFO L93 Difference]: Finished difference Result 1209 states and 4271 transitions. [2020-01-16 18:11:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:51,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:51,733 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:11:51,733 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:11:51,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:11:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:11:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-01-16 18:11:51,754 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-01-16 18:11:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:51,754 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-01-16 18:11:51,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-01-16 18:11:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:51,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:51,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:51,755 INFO L426 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1583398403, now seen corresponding path program 855 times [2020-01-16 18:11:51,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:51,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751129400] [2020-01-16 18:11:51,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:52,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-01-16 18:11:52,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751129400] [2020-01-16 18:11:52,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:52,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:52,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313958382] [2020-01-16 18:11:52,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:52,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:52,184 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:11:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:52,331 INFO L93 Difference]: Finished difference Result 1215 states and 4284 transitions. [2020-01-16 18:11:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:52,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:52,334 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:11:52,335 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:11:52,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:11:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-01-16 18:11:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:11:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:11:52,356 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:11:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:52,356 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:11:52,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:11:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:52,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:52,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:52,358 INFO L426 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1720311071, now seen corresponding path program 856 times [2020-01-16 18:11:52,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:52,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300972177] [2020-01-16 18:11:52,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300972177] [2020-01-16 18:11:52,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:52,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:52,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002924965] [2020-01-16 18:11:52,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:52,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:52,776 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:11:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:52,925 INFO L93 Difference]: Finished difference Result 1218 states and 4286 transitions. [2020-01-16 18:11:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:52,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:52,929 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:11:52,930 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:11:52,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:11:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:11:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:11:52,951 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:11:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:52,951 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:11:52,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:11:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:52,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:52,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:52,953 INFO L426 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1302340453, now seen corresponding path program 857 times [2020-01-16 18:11:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:52,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153153436] [2020-01-16 18:11:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:53,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-01-16 18:11:53,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153153436] [2020-01-16 18:11:53,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:53,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:53,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352249898] [2020-01-16 18:11:53,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:53,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:53,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:53,375 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:11:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:53,523 INFO L93 Difference]: Finished difference Result 1212 states and 4274 transitions. [2020-01-16 18:11:53,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:53,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:53,527 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:11:53,527 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:11:53,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:11:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 780. [2020-01-16 18:11:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:11:53,548 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:11:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:53,548 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:11:53,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:11:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:53,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:53,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:53,550 INFO L426 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1381685885, now seen corresponding path program 858 times [2020-01-16 18:11:53,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:53,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411671614] [2020-01-16 18:11:53,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:53,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411671614] [2020-01-16 18:11:53,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:53,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:53,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871320815] [2020-01-16 18:11:53,963 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:53,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:53,963 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:11:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:54,114 INFO L93 Difference]: Finished difference Result 1216 states and 4279 transitions. [2020-01-16 18:11:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:54,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:54,117 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:11:54,117 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:11:54,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:11:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 774. [2020-01-16 18:11:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:11:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-01-16 18:11:54,137 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-01-16 18:11:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:54,137 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-01-16 18:11:54,137 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-01-16 18:11:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:54,138 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:54,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:54,139 INFO L426 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -998794271, now seen corresponding path program 859 times [2020-01-16 18:11:54,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:54,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581687349] [2020-01-16 18:11:54,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:54,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581687349] [2020-01-16 18:11:54,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:54,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:54,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990607165] [2020-01-16 18:11:54,559 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:54,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:54,559 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:11:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:54,707 INFO L93 Difference]: Finished difference Result 1218 states and 4291 transitions. [2020-01-16 18:11:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:54,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:54,712 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:11:54,712 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:11:54,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:11:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 780. [2020-01-16 18:11:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-01-16 18:11:54,743 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-01-16 18:11:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:54,744 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-01-16 18:11:54,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-01-16 18:11:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:54,745 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:54,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:54,745 INFO L426 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash 612146687, now seen corresponding path program 860 times [2020-01-16 18:11:54,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:54,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481079571] [2020-01-16 18:11:54,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:55,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481079571] [2020-01-16 18:11:55,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:55,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:55,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335143620] [2020-01-16 18:11:55,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:55,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:55,163 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:11:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:55,306 INFO L93 Difference]: Finished difference Result 1215 states and 4282 transitions. [2020-01-16 18:11:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:55,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:55,309 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:11:55,310 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:11:55,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:11:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 777. [2020-01-16 18:11:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:11:55,332 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:11:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:55,332 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:11:55,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:11:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:55,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:55,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] [2020-01-16 18:11:55,333 INFO L426 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1695735171, now seen corresponding path program 861 times [2020-01-16 18:11:55,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:55,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531589794] [2020-01-16 18:11:55,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:55,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531589794] [2020-01-16 18:11:55,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:55,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:55,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770365409] [2020-01-16 18:11:55,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:55,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:55,752 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:11:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:55,895 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-01-16 18:11:55,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:55,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:55,899 INFO L225 Difference]: With dead ends: 1225 [2020-01-16 18:11:55,899 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:11:55,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:11:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 783. [2020-01-16 18:11:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:11:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-01-16 18:11:55,920 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-01-16 18:11:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:55,920 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-01-16 18:11:55,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-01-16 18:11:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:55,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:55,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:55,921 INFO L426 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash 622649791, now seen corresponding path program 862 times [2020-01-16 18:11:55,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:55,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790120572] [2020-01-16 18:11:55,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:56,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-01-16 18:11:56,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790120572] [2020-01-16 18:11:56,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:56,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:56,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881836960] [2020-01-16 18:11:56,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:56,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:56,341 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-01-16 18:11:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:56,488 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:11:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:56,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:56,492 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:11:56,492 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:11:56,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:11:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-01-16 18:11:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:11:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:11:56,513 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:11:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:56,513 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:11:56,513 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:11:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:56,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:56,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:56,514 INFO L426 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1706238275, now seen corresponding path program 863 times [2020-01-16 18:11:56,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:56,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236424658] [2020-01-16 18:11:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:56,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236424658] [2020-01-16 18:11:56,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:56,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:56,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101305906] [2020-01-16 18:11:56,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:56,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:56,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:56,938 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:11:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:57,095 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:11:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:57,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:57,098 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:11:57,098 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:11:57,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:11:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-01-16 18:11:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-01-16 18:11:57,119 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:57,119 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-01-16 18:11:57,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-01-16 18:11:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:57,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:57,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:57,121 INFO L426 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -977788063, now seen corresponding path program 864 times [2020-01-16 18:11:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:57,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939370046] [2020-01-16 18:11:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:57,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939370046] [2020-01-16 18:11:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:57,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311781513] [2020-01-16 18:11:57,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:57,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:57,555 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:57,705 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-01-16 18:11:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:57,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:57,709 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:11:57,709 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:11:57,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:11:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 771. [2020-01-16 18:11:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:11:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3085 transitions. [2020-01-16 18:11:57,730 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3085 transitions. Word has length 25 [2020-01-16 18:11:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:57,730 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3085 transitions. [2020-01-16 18:11:57,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3085 transitions. [2020-01-16 18:11:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:57,731 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:57,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:57,731 INFO L426 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2060165155, now seen corresponding path program 865 times [2020-01-16 18:11:57,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:57,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970282699] [2020-01-16 18:11:57,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:58,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-01-16 18:11:58,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970282699] [2020-01-16 18:11:58,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:58,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:58,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442576287] [2020-01-16 18:11:58,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:58,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:58,147 INFO L87 Difference]: Start difference. First operand 771 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:11:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:58,298 INFO L93 Difference]: Finished difference Result 1196 states and 4235 transitions. [2020-01-16 18:11:58,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:58,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:58,302 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:11:58,302 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:11:58,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:11:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 780. [2020-01-16 18:11:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:11:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:11:58,323 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:11:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:58,324 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:11:58,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:11:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:58,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:58,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:58,325 INFO L426 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1089913541, now seen corresponding path program 866 times [2020-01-16 18:11:58,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:58,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170739904] [2020-01-16 18:11:58,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:58,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-01-16 18:11:58,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170739904] [2020-01-16 18:11:58,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:58,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698843515] [2020-01-16 18:11:58,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:58,739 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:11:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:58,889 INFO L93 Difference]: Finished difference Result 1198 states and 4235 transitions. [2020-01-16 18:11:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:58,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:58,892 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:11:58,893 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:11:58,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:11:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-01-16 18:11:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:11:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3102 transitions. [2020-01-16 18:11:58,913 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3102 transitions. Word has length 25 [2020-01-16 18:11:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:58,914 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3102 transitions. [2020-01-16 18:11:58,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3102 transitions. [2020-01-16 18:11:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:58,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:58,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:11:58,915 INFO L426 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -134131077, now seen corresponding path program 867 times [2020-01-16 18:11:58,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:58,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103229545] [2020-01-16 18:11:58,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:59,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-01-16 18:11:59,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103229545] [2020-01-16 18:11:59,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:59,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:59,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227664364] [2020-01-16 18:11:59,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:59,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:59,334 INFO L87 Difference]: Start difference. First operand 776 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:11:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:11:59,480 INFO L93 Difference]: Finished difference Result 1192 states and 4223 transitions. [2020-01-16 18:11:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:11:59,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:11:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:11:59,483 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:11:59,483 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:11:59,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:11:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:11:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-01-16 18:11:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:11:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3107 transitions. [2020-01-16 18:11:59,504 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3107 transitions. Word has length 25 [2020-01-16 18:11:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:11:59,505 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3107 transitions. [2020-01-16 18:11:59,505 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:11:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3107 transitions. [2020-01-16 18:11:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:11:59,506 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:11:59,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] [2020-01-16 18:11:59,506 INFO L426 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:11:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:11:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash 846623641, now seen corresponding path program 868 times [2020-01-16 18:11:59,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:11:59,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190316438] [2020-01-16 18:11:59,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:11:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:11:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:11:59,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190316438] [2020-01-16 18:11:59,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:11:59,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:11:59,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953537778] [2020-01-16 18:11:59,923 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:11:59,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:11:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:11:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:11:59,923 INFO L87 Difference]: Start difference. First operand 779 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:12:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:00,099 INFO L93 Difference]: Finished difference Result 1191 states and 4218 transitions. [2020-01-16 18:12:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:00,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:00,103 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:12:00,103 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:12:00,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:12:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-01-16 18:12:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:12:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3099 transitions. [2020-01-16 18:12:00,124 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3099 transitions. Word has length 25 [2020-01-16 18:12:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:00,124 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3099 transitions. [2020-01-16 18:12:00,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3099 transitions. [2020-01-16 18:12:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:00,125 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:00,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:00,125 INFO L426 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -751288355, now seen corresponding path program 869 times [2020-01-16 18:12:00,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:00,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181104787] [2020-01-16 18:12:00,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:00,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181104787] [2020-01-16 18:12:00,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:00,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:00,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96884409] [2020-01-16 18:12:00,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:00,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:00,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:00,560 INFO L87 Difference]: Start difference. First operand 776 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:12:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:00,712 INFO L93 Difference]: Finished difference Result 1196 states and 4228 transitions. [2020-01-16 18:12:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:00,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:00,716 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:12:00,716 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:12:00,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:12:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:12:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:12:00,738 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:12:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:00,738 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:12:00,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:12:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:00,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:00,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:00,739 INFO L426 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 859652603, now seen corresponding path program 870 times [2020-01-16 18:12:00,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:00,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619839182] [2020-01-16 18:12:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:01,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619839182] [2020-01-16 18:12:01,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:01,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139447562] [2020-01-16 18:12:01,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:01,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:01,164 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:12:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:01,326 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-01-16 18:12:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:01,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:01,330 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:12:01,330 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:01,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-01-16 18:12:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3092 transitions. [2020-01-16 18:12:01,351 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:01,352 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3092 transitions. [2020-01-16 18:12:01,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3092 transitions. [2020-01-16 18:12:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:01,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:01,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:01,353 INFO L426 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 544859237, now seen corresponding path program 871 times [2020-01-16 18:12:01,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:01,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914429970] [2020-01-16 18:12:01,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:01,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914429970] [2020-01-16 18:12:01,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:01,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:01,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435367682] [2020-01-16 18:12:01,762 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:01,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:01,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:01,762 INFO L87 Difference]: Start difference. First operand 773 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:01,933 INFO L93 Difference]: Finished difference Result 1192 states and 4221 transitions. [2020-01-16 18:12:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:01,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:01,936 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:12:01,937 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:12:01,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:12:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-01-16 18:12:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-01-16 18:12:01,958 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-01-16 18:12:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:01,959 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-01-16 18:12:01,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-01-16 18:12:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:01,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:01,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:01,960 INFO L426 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1515110851, now seen corresponding path program 872 times [2020-01-16 18:12:01,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:01,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836986434] [2020-01-16 18:12:01,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:02,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836986434] [2020-01-16 18:12:02,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:02,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:02,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204636205] [2020-01-16 18:12:02,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:02,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:02,366 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:12:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:02,510 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-01-16 18:12:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:02,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:02,513 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:02,514 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:02,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:12:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-01-16 18:12:02,536 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-01-16 18:12:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:02,536 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-01-16 18:12:02,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-01-16 18:12:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:02,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:02,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:02,537 INFO L426 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1585095035, now seen corresponding path program 873 times [2020-01-16 18:12:02,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:02,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022176581] [2020-01-16 18:12:02,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:02,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022176581] [2020-01-16 18:12:02,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:02,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:02,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748824890] [2020-01-16 18:12:02,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:02,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:02,946 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:12:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:03,096 INFO L93 Difference]: Finished difference Result 1186 states and 4205 transitions. [2020-01-16 18:12:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:03,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:03,100 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:12:03,100 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:12:03,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:12:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-01-16 18:12:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-01-16 18:12:03,121 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-01-16 18:12:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:03,121 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-01-16 18:12:03,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-01-16 18:12:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:03,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:03,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:03,122 INFO L426 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1687105127, now seen corresponding path program 874 times [2020-01-16 18:12:03,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:03,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343150893] [2020-01-16 18:12:03,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:03,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343150893] [2020-01-16 18:12:03,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:03,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:03,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459487798] [2020-01-16 18:12:03,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:03,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:03,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:03,546 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:12:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:03,701 INFO L93 Difference]: Finished difference Result 1184 states and 4199 transitions. [2020-01-16 18:12:03,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:03,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:03,705 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:12:03,705 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:12:03,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:12:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:12:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:12:03,725 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:12:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:03,726 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:12:03,726 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:12:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:03,727 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:03,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] [2020-01-16 18:12:03,727 INFO L426 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1138846363, now seen corresponding path program 875 times [2020-01-16 18:12:03,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:03,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062273516] [2020-01-16 18:12:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:04,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-01-16 18:12:04,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062273516] [2020-01-16 18:12:04,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:04,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:04,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85645549] [2020-01-16 18:12:04,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:04,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:04,125 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:12:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:04,268 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-01-16 18:12:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:04,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:04,272 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:12:04,272 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:04,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:12:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:12:04,293 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:04,293 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:12:04,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:12:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:04,294 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:04,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:04,294 INFO L426 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1674076165, now seen corresponding path program 876 times [2020-01-16 18:12:04,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:04,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762458686] [2020-01-16 18:12:04,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:04,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762458686] [2020-01-16 18:12:04,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:04,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:04,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020109649] [2020-01-16 18:12:04,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:04,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:04,700 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:04,854 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-01-16 18:12:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:04,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:04,858 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:12:04,858 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:12:04,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:12:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:12:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:12:04,879 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:12:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:04,879 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:12:04,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:12:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:04,880 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:04,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:04,880 INFO L426 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2048407589, now seen corresponding path program 877 times [2020-01-16 18:12:04,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:04,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153380670] [2020-01-16 18:12:04,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:05,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153380670] [2020-01-16 18:12:05,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:05,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:05,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438711733] [2020-01-16 18:12:05,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:05,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:05,299 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:12:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:05,455 INFO L93 Difference]: Finished difference Result 1184 states and 4201 transitions. [2020-01-16 18:12:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:05,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:05,459 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:12:05,459 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:12:05,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:12:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 778. [2020-01-16 18:12:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-01-16 18:12:05,480 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-01-16 18:12:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:05,480 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-01-16 18:12:05,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-01-16 18:12:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:05,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:05,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:05,481 INFO L426 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1265804989, now seen corresponding path program 878 times [2020-01-16 18:12:05,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:05,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314112873] [2020-01-16 18:12:05,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:05,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314112873] [2020-01-16 18:12:05,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:05,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:05,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278378247] [2020-01-16 18:12:05,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:05,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:05,912 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:12:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:06,073 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-01-16 18:12:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:06,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:06,077 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:12:06,077 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:12:06,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:12:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:12:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:12:06,098 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:12:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:06,098 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:12:06,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:12:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:06,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:06,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:06,099 INFO L426 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1162609309, now seen corresponding path program 879 times [2020-01-16 18:12:06,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:06,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240366171] [2020-01-16 18:12:06,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:06,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240366171] [2020-01-16 18:12:06,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:06,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:06,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703042723] [2020-01-16 18:12:06,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:06,526 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:12:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:06,676 INFO L93 Difference]: Finished difference Result 1182 states and 4194 transitions. [2020-01-16 18:12:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:06,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:06,680 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:12:06,680 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:12:06,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:12:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:12:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:12:06,701 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:06,701 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:12:06,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:12:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:06,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:06,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:06,703 INFO L426 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2109590853, now seen corresponding path program 880 times [2020-01-16 18:12:06,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:06,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613751921] [2020-01-16 18:12:06,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:07,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613751921] [2020-01-16 18:12:07,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:07,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:07,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806224311] [2020-01-16 18:12:07,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:07,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:07,119 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:07,277 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:12:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:07,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:07,281 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:12:07,281 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:12:07,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:12:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-01-16 18:12:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:12:07,303 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:07,303 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:12:07,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:12:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:07,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:07,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:07,305 INFO L426 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 375205093, now seen corresponding path program 881 times [2020-01-16 18:12:07,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:07,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083830185] [2020-01-16 18:12:07,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:07,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083830185] [2020-01-16 18:12:07,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:07,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:07,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347268507] [2020-01-16 18:12:07,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:07,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:07,730 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:07,885 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:12:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:07,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:07,888 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:12:07,888 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:12:07,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:12:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:12:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:12:07,909 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:07,910 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:12:07,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:12:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:07,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:07,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:07,911 INFO L426 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1770965667, now seen corresponding path program 882 times [2020-01-16 18:12:07,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:07,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565081366] [2020-01-16 18:12:07,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:08,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565081366] [2020-01-16 18:12:08,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:08,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:08,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857602267] [2020-01-16 18:12:08,338 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:08,339 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:08,495 INFO L93 Difference]: Finished difference Result 1179 states and 4184 transitions. [2020-01-16 18:12:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:08,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:08,499 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:12:08,499 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:12:08,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:12:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 773. [2020-01-16 18:12:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:12:08,521 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:12:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:08,521 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:12:08,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:12:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:08,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:08,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:08,522 INFO L426 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1419583365, now seen corresponding path program 883 times [2020-01-16 18:12:08,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:08,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945703972] [2020-01-16 18:12:08,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:08,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945703972] [2020-01-16 18:12:08,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:08,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:08,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904386571] [2020-01-16 18:12:08,938 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:08,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:08,938 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:12:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:09,090 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-01-16 18:12:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:09,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:09,093 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:12:09,093 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:09,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 778. [2020-01-16 18:12:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:12:09,114 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:12:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:09,114 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:12:09,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:12:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:09,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:09,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:09,115 INFO L426 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash 191357593, now seen corresponding path program 884 times [2020-01-16 18:12:09,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:09,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837093495] [2020-01-16 18:12:09,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:09,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837093495] [2020-01-16 18:12:09,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:09,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:09,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546869234] [2020-01-16 18:12:09,548 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:09,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:09,548 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:12:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:09,720 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:12:09,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:09,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:09,724 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:12:09,724 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:12:09,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:12:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-01-16 18:12:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:12:09,746 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:09,746 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:12:09,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:12:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:09,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:09,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:09,748 INFO L426 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:09,748 INFO L82 PathProgramCache]: Analyzing trace with hash 768599811, now seen corresponding path program 885 times [2020-01-16 18:12:09,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:09,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699349893] [2020-01-16 18:12:09,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:10,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699349893] [2020-01-16 18:12:10,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:10,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:10,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440244719] [2020-01-16 18:12:10,166 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:10,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:10,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:10,166 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:10,316 INFO L93 Difference]: Finished difference Result 1188 states and 4204 transitions. [2020-01-16 18:12:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:10,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:10,319 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:12:10,320 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:12:10,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:12:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-01-16 18:12:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:12:10,341 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:10,341 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:12:10,341 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:12:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:10,342 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:10,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] [2020-01-16 18:12:10,342 INFO L426 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 233370009, now seen corresponding path program 886 times [2020-01-16 18:12:10,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:10,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560477657] [2020-01-16 18:12:10,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:10,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560477657] [2020-01-16 18:12:10,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:10,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:10,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774338279] [2020-01-16 18:12:10,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:10,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:10,757 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:10,912 INFO L93 Difference]: Finished difference Result 1184 states and 4194 transitions. [2020-01-16 18:12:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:10,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:10,916 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:12:10,916 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:12:10,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:12:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:12:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:10,938 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:10,938 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:10,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:10,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:10,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:10,939 INFO L426 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 779102915, now seen corresponding path program 887 times [2020-01-16 18:12:10,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:10,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603938583] [2020-01-16 18:12:10,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:11,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603938583] [2020-01-16 18:12:11,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:11,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:11,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008279814] [2020-01-16 18:12:11,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:11,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:11,365 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:11,520 INFO L93 Difference]: Finished difference Result 1182 states and 4190 transitions. [2020-01-16 18:12:11,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:11,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:11,524 INFO L225 Difference]: With dead ends: 1182 [2020-01-16 18:12:11,524 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:12:11,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:12:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:12:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:11,545 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:11,545 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:11,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:11,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:11,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:11,546 INFO L426 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1367067845, now seen corresponding path program 888 times [2020-01-16 18:12:11,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:11,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312469641] [2020-01-16 18:12:11,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:11,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312469641] [2020-01-16 18:12:11,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:11,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:11,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503621272] [2020-01-16 18:12:11,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:11,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:11,986 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:12,146 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:12:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:12,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:12,149 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:12:12,150 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:12:12,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:12:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 771. [2020-01-16 18:12:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:12:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-01-16 18:12:12,170 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-01-16 18:12:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:12,170 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-01-16 18:12:12,170 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-01-16 18:12:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:12,171 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:12,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:12,172 INFO L426 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1600160797, now seen corresponding path program 889 times [2020-01-16 18:12:12,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:12,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504534804] [2020-01-16 18:12:12,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:12,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504534804] [2020-01-16 18:12:12,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:12,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:12,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238498596] [2020-01-16 18:12:12,587 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:12,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:12,587 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:12:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:12,749 INFO L93 Difference]: Finished difference Result 1214 states and 4281 transitions. [2020-01-16 18:12:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:12,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:12,753 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:12:12,753 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:12:12,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:12:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 781. [2020-01-16 18:12:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:12:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3114 transitions. [2020-01-16 18:12:12,775 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3114 transitions. Word has length 25 [2020-01-16 18:12:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:12,775 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3114 transitions. [2020-01-16 18:12:12,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3114 transitions. [2020-01-16 18:12:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:12,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:12,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:12,776 INFO L426 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1724554885, now seen corresponding path program 890 times [2020-01-16 18:12:12,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:12,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35180902] [2020-01-16 18:12:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:13,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35180902] [2020-01-16 18:12:13,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:13,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:13,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284663754] [2020-01-16 18:12:13,175 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:13,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:13,175 INFO L87 Difference]: Start difference. First operand 781 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:12:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:13,353 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:12:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:13,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:13,356 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:12:13,357 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:12:13,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:12:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-01-16 18:12:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-01-16 18:12:13,378 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-01-16 18:12:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:13,378 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-01-16 18:12:13,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-01-16 18:12:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:13,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:13,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:13,379 INFO L426 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1157261657, now seen corresponding path program 891 times [2020-01-16 18:12:13,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:13,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721951199] [2020-01-16 18:12:13,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:13,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721951199] [2020-01-16 18:12:13,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:13,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:13,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716213399] [2020-01-16 18:12:13,773 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:13,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:13,773 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:12:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:13,920 INFO L93 Difference]: Finished difference Result 1215 states and 4279 transitions. [2020-01-16 18:12:13,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:13,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:13,924 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:12:13,924 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:12:13,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:12:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-01-16 18:12:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:12:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:12:13,947 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:12:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:13,947 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:12:13,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:12:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:13,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:13,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:13,948 INFO L426 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2146447817, now seen corresponding path program 892 times [2020-01-16 18:12:13,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:13,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032064683] [2020-01-16 18:12:13,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:14,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032064683] [2020-01-16 18:12:14,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:14,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:14,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207800574] [2020-01-16 18:12:14,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:14,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:14,348 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:12:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:14,505 INFO L93 Difference]: Finished difference Result 1218 states and 4281 transitions. [2020-01-16 18:12:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:14,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:14,508 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:12:14,508 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:12:14,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:12:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:12:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-01-16 18:12:14,529 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-01-16 18:12:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:14,530 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-01-16 18:12:14,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-01-16 18:12:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:14,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:14,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:14,531 INFO L426 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1060333475, now seen corresponding path program 893 times [2020-01-16 18:12:14,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:14,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532559795] [2020-01-16 18:12:14,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532559795] [2020-01-16 18:12:14,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:14,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:14,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538096063] [2020-01-16 18:12:14,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:14,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:14,930 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:12:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:15,083 INFO L93 Difference]: Finished difference Result 1221 states and 4289 transitions. [2020-01-16 18:12:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:15,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:15,086 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:12:15,087 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:12:15,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:12:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-01-16 18:12:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:12:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-01-16 18:12:15,107 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-01-16 18:12:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:15,107 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-01-16 18:12:15,107 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-01-16 18:12:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:15,108 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:15,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:15,108 INFO L426 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2133418855, now seen corresponding path program 894 times [2020-01-16 18:12:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999726216] [2020-01-16 18:12:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:15,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-01-16 18:12:15,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999726216] [2020-01-16 18:12:15,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:15,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:15,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781076671] [2020-01-16 18:12:15,519 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:15,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:15,519 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:12:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:15,672 INFO L93 Difference]: Finished difference Result 1222 states and 4285 transitions. [2020-01-16 18:12:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:15,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:15,676 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:12:15,676 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:12:15,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:12:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 773. [2020-01-16 18:12:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:12:15,697 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:12:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:15,697 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:12:15,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:12:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:15,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:15,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:15,699 INFO L426 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 332703619, now seen corresponding path program 895 times [2020-01-16 18:12:15,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:15,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544488908] [2020-01-16 18:12:15,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:16,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544488908] [2020-01-16 18:12:16,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:16,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:16,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414218515] [2020-01-16 18:12:16,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:16,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:16,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:16,088 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:12:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:16,237 INFO L93 Difference]: Finished difference Result 1201 states and 4243 transitions. [2020-01-16 18:12:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:16,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:16,240 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:12:16,240 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:12:16,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:12:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-01-16 18:12:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:12:16,262 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:12:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:16,262 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:12:16,262 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:12:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:16,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:16,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:16,264 INFO L426 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1302955233, now seen corresponding path program 896 times [2020-01-16 18:12:16,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:16,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057445443] [2020-01-16 18:12:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:16,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057445443] [2020-01-16 18:12:16,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:16,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:16,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533251441] [2020-01-16 18:12:16,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:16,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:16,649 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:12:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:16,802 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-01-16 18:12:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:16,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:16,805 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:12:16,805 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:12:16,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:12:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-01-16 18:12:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:12:16,826 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:12:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:16,826 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:12:16,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:12:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:16,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:16,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:16,827 INFO L426 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1372939417, now seen corresponding path program 897 times [2020-01-16 18:12:16,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:16,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681332307] [2020-01-16 18:12:16,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:17,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-01-16 18:12:17,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681332307] [2020-01-16 18:12:17,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:17,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:17,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265841143] [2020-01-16 18:12:17,210 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:17,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:17,210 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:12:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:17,363 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-01-16 18:12:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:17,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:17,366 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:12:17,366 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:17,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-01-16 18:12:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:12:17,387 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:17,387 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:12:17,387 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:12:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:17,388 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:17,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:17,388 INFO L426 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:17,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1899260745, now seen corresponding path program 898 times [2020-01-16 18:12:17,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:17,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869553385] [2020-01-16 18:12:17,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12: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-01-16 18:12:17,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869553385] [2020-01-16 18:12:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:17,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299469034] [2020-01-16 18:12:17,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:17,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:17,804 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:17,960 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:12:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:17,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:17,963 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:12:17,963 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:12:17,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:12:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-01-16 18:12:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:12:17,984 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:17,984 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:12:17,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:12:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:17,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:17,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:17,986 INFO L426 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1351001981, now seen corresponding path program 899 times [2020-01-16 18:12:17,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:17,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685570241] [2020-01-16 18:12:17,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:18,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685570241] [2020-01-16 18:12:18,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:18,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:18,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473951410] [2020-01-16 18:12:18,365 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:18,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:18,365 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:18,556 INFO L93 Difference]: Finished difference Result 1199 states and 4233 transitions. [2020-01-16 18:12:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:18,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:18,559 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:12:18,559 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:12:18,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:12:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-01-16 18:12:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:12:18,581 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:18,581 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:12:18,581 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:12:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:18,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:18,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] [2020-01-16 18:12:18,582 INFO L426 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1886231783, now seen corresponding path program 900 times [2020-01-16 18:12:18,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:18,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892188513] [2020-01-16 18:12:18,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892188513] [2020-01-16 18:12:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:18,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:18,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390077545] [2020-01-16 18:12:18,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:18,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:18,964 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:19,119 INFO L93 Difference]: Finished difference Result 1195 states and 4223 transitions. [2020-01-16 18:12:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:19,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:19,122 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:12:19,122 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:12:19,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:12:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 773. [2020-01-16 18:12:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:12:19,143 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:12:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:19,143 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:12:19,144 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:12:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:19,145 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:19,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:19,145 INFO L426 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash -955166973, now seen corresponding path program 901 times [2020-01-16 18:12:19,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:19,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472036481] [2020-01-16 18:12:19,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:19,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-01-16 18:12:19,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472036481] [2020-01-16 18:12:19,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:19,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:19,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999064439] [2020-01-16 18:12:19,530 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:19,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:19,530 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:12:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:19,703 INFO L93 Difference]: Finished difference Result 1203 states and 4245 transitions. [2020-01-16 18:12:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:19,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:19,706 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:12:19,707 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:12:19,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:12:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 779. [2020-01-16 18:12:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:12:19,728 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:12:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:19,728 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:12:19,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:12:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:19,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:19,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:19,729 INFO L426 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 36090849, now seen corresponding path program 902 times [2020-01-16 18:12:19,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:19,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578731946] [2020-01-16 18:12:19,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:20,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578731946] [2020-01-16 18:12:20,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:20,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:20,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60106541] [2020-01-16 18:12:20,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:20,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:20,136 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:12:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:20,290 INFO L93 Difference]: Finished difference Result 1206 states and 4247 transitions. [2020-01-16 18:12:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:20,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:20,294 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:12:20,294 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:20,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 775. [2020-01-16 18:12:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:12:20,316 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:20,316 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:12:20,316 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:12:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:20,317 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:20,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] [2020-01-16 18:12:20,317 INFO L426 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash 527967965, now seen corresponding path program 903 times [2020-01-16 18:12:20,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:20,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805455821] [2020-01-16 18:12:20,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:20,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805455821] [2020-01-16 18:12:20,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:20,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:20,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429200622] [2020-01-16 18:12:20,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:20,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:20,699 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:20,853 INFO L93 Difference]: Finished difference Result 1196 states and 4227 transitions. [2020-01-16 18:12:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:20,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:20,857 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:12:20,857 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:12:20,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:12:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-01-16 18:12:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:12:20,879 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:20,879 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:12:20,879 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:12:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:20,880 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:20,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:20,880 INFO L426 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1550735099, now seen corresponding path program 904 times [2020-01-16 18:12:20,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:20,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463445295] [2020-01-16 18:12:20,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:21,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463445295] [2020-01-16 18:12:21,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:21,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:21,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525084912] [2020-01-16 18:12:21,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:21,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:21,277 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:21,436 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-01-16 18:12:21,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:21,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:21,440 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:21,440 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:12:21,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:12:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:12:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:21,461 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:21,462 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:21,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:21,463 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:21,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:21,463 INFO L426 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1677100931, now seen corresponding path program 905 times [2020-01-16 18:12:21,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:21,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974792696] [2020-01-16 18:12:21,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:21,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974792696] [2020-01-16 18:12:21,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:21,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:21,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249541783] [2020-01-16 18:12:21,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:21,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:21,869 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:22,043 INFO L93 Difference]: Finished difference Result 1202 states and 4237 transitions. [2020-01-16 18:12:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:22,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:22,047 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:12:22,047 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:22,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:12:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:22,068 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:22,068 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:22,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:22,069 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:22,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:22,070 INFO L426 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2080010787, now seen corresponding path program 906 times [2020-01-16 18:12:22,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:22,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267958387] [2020-01-16 18:12:22,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:22,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267958387] [2020-01-16 18:12:22,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:22,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:22,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753358713] [2020-01-16 18:12:22,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:22,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:22,460 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:22,639 INFO L93 Difference]: Finished difference Result 1197 states and 4225 transitions. [2020-01-16 18:12:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:22,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:22,643 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:12:22,643 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:22,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:12:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:12:22,663 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:12:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:22,663 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:12:22,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:12:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:22,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:22,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:22,665 INFO L426 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:22,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1728628485, now seen corresponding path program 907 times [2020-01-16 18:12:22,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:22,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874256660] [2020-01-16 18:12:22,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:23,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-01-16 18:12:23,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874256660] [2020-01-16 18:12:23,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:23,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:23,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742673390] [2020-01-16 18:12:23,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:23,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:23,064 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:12:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:23,212 INFO L93 Difference]: Finished difference Result 1213 states and 4267 transitions. [2020-01-16 18:12:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:23,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:23,216 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:12:23,216 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:12:23,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:12:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-01-16 18:12:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:12:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:12:23,238 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:12:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:23,238 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:12:23,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:12:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:23,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:23,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:23,239 INFO L426 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1493253431, now seen corresponding path program 908 times [2020-01-16 18:12:23,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:23,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315095951] [2020-01-16 18:12:23,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:23,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315095951] [2020-01-16 18:12:23,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:23,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:23,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281375621] [2020-01-16 18:12:23,630 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:23,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:23,630 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:12:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:23,779 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-01-16 18:12:23,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:23,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:23,782 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:12:23,782 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:12:23,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:12:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:12:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:23,804 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:23,805 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:23,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:23,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:23,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:23,806 INFO L426 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:23,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2059992545, now seen corresponding path program 909 times [2020-01-16 18:12:23,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:23,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706919009] [2020-01-16 18:12:23,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:24,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-01-16 18:12:24,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706919009] [2020-01-16 18:12:24,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:24,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:24,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721734169] [2020-01-16 18:12:24,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:24,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:24,193 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:24,362 INFO L93 Difference]: Finished difference Result 1204 states and 4243 transitions. [2020-01-16 18:12:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:24,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:24,365 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:12:24,366 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:12:24,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:12:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-01-16 18:12:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:24,389 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:24,389 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:24,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:24,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:24,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:24,390 INFO L426 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1524762743, now seen corresponding path program 910 times [2020-01-16 18:12:24,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:24,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683764015] [2020-01-16 18:12:24,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:24,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683764015] [2020-01-16 18:12:24,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:24,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590966176] [2020-01-16 18:12:24,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:24,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:24,788 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:24,960 INFO L93 Difference]: Finished difference Result 1200 states and 4233 transitions. [2020-01-16 18:12:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:24,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:24,964 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:12:24,964 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:12:24,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:12:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-01-16 18:12:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:12:24,985 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:12:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:24,986 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:12:24,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:12:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:24,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:24,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:24,987 INFO L426 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:24,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2080998753, now seen corresponding path program 911 times [2020-01-16 18:12:24,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:24,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980879013] [2020-01-16 18:12:24,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:25,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980879013] [2020-01-16 18:12:25,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:25,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:25,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611763822] [2020-01-16 18:12:25,384 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:25,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:25,384 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:12:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:25,533 INFO L93 Difference]: Finished difference Result 1206 states and 4245 transitions. [2020-01-16 18:12:25,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:25,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:25,536 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:12:25,536 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:12:25,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:12:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:12:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:12:25,558 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:25,558 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:12:25,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:12:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:25,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:25,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:25,560 INFO L426 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1676112965, now seen corresponding path program 912 times [2020-01-16 18:12:25,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:25,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089535229] [2020-01-16 18:12:25,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:25,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089535229] [2020-01-16 18:12:25,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:25,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:25,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321933091] [2020-01-16 18:12:25,957 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:25,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:25,957 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:26,128 INFO L93 Difference]: Finished difference Result 1201 states and 4233 transitions. [2020-01-16 18:12:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:26,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:26,131 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:12:26,132 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:12:26,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:12:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-01-16 18:12:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:12:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:12:26,152 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:12:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:26,152 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:12:26,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:12:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:26,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:26,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] [2020-01-16 18:12:26,154 INFO L426 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1403413765, now seen corresponding path program 913 times [2020-01-16 18:12:26,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:26,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459387627] [2020-01-16 18:12:26,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:26,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-01-16 18:12:26,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459387627] [2020-01-16 18:12:26,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:26,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:26,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230949120] [2020-01-16 18:12:26,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:26,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:26,580 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:12:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:26,740 INFO L93 Difference]: Finished difference Result 1194 states and 4226 transitions. [2020-01-16 18:12:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:26,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:26,743 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:26,743 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:12:26,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:12:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:12:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-01-16 18:12:26,764 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-01-16 18:12:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:26,764 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-01-16 18:12:26,764 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-01-16 18:12:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:26,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:26,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:26,765 INFO L426 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -422659047, now seen corresponding path program 914 times [2020-01-16 18:12:26,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:26,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125707029] [2020-01-16 18:12:26,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125707029] [2020-01-16 18:12:27,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:27,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:27,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913213691] [2020-01-16 18:12:27,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:27,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:27,182 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:12:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:27,359 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:12:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:27,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:27,363 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:12:27,363 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:27,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 776. [2020-01-16 18:12:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:12:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3098 transitions. [2020-01-16 18:12:27,385 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:27,385 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3098 transitions. [2020-01-16 18:12:27,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3098 transitions. [2020-01-16 18:12:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:27,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:27,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:27,386 INFO L426 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash 522620313, now seen corresponding path program 915 times [2020-01-16 18:12:27,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:27,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241824207] [2020-01-16 18:12:27,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:27,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-01-16 18:12:27,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241824207] [2020-01-16 18:12:27,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:27,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:27,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209012998] [2020-01-16 18:12:27,808 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:27,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:27,808 INFO L87 Difference]: Start difference. First operand 776 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:27,971 INFO L93 Difference]: Finished difference Result 1199 states and 4234 transitions. [2020-01-16 18:12:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:27,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:27,974 INFO L225 Difference]: With dead ends: 1199 [2020-01-16 18:12:27,974 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:27,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-01-16 18:12:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:12:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-01-16 18:12:27,995 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-01-16 18:12:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:27,995 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-01-16 18:12:27,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-01-16 18:12:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:27,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:27,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:27,996 INFO L426 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1513878135, now seen corresponding path program 916 times [2020-01-16 18:12:27,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17940243] [2020-01-16 18:12:27,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:28,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17940243] [2020-01-16 18:12:28,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:28,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:28,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575655342] [2020-01-16 18:12:28,416 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:28,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:28,416 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:12:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:28,572 INFO L93 Difference]: Finished difference Result 1202 states and 4236 transitions. [2020-01-16 18:12:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:28,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:28,576 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:12:28,576 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:28,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 776. [2020-01-16 18:12:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:12:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3095 transitions. [2020-01-16 18:12:28,598 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3095 transitions. Word has length 25 [2020-01-16 18:12:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:28,598 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3095 transitions. [2020-01-16 18:12:28,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3095 transitions. [2020-01-16 18:12:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:28,599 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:28,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:28,600 INFO L426 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 241562363, now seen corresponding path program 917 times [2020-01-16 18:12:28,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:28,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548580108] [2020-01-16 18:12:28,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:29,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548580108] [2020-01-16 18:12:29,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:29,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:29,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626694158] [2020-01-16 18:12:29,021 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:29,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:29,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:29,021 INFO L87 Difference]: Start difference. First operand 776 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:12:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:29,172 INFO L93 Difference]: Finished difference Result 1196 states and 4224 transitions. [2020-01-16 18:12:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:29,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:29,176 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:12:29,176 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:12:29,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:12:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-01-16 18:12:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:12:29,198 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:12:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:29,198 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:12:29,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:12:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:29,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:29,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:29,199 INFO L426 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1852503321, now seen corresponding path program 918 times [2020-01-16 18:12:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378879146] [2020-01-16 18:12:29,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:29,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378879146] [2020-01-16 18:12:29,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:29,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:29,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844749987] [2020-01-16 18:12:29,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:29,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:29,616 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:12:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:29,773 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:12:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:29,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:29,776 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:12:29,776 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:29,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-01-16 18:12:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:12:29,798 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:12:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:29,798 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:12:29,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:12:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:29,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:29,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:29,799 INFO L426 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1624096353, now seen corresponding path program 919 times [2020-01-16 18:12:29,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:29,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709820212] [2020-01-16 18:12:29,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:30,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709820212] [2020-01-16 18:12:30,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:30,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:30,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146219131] [2020-01-16 18:12:30,221 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:30,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:30,221 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:12:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:30,372 INFO L93 Difference]: Finished difference Result 1185 states and 4201 transitions. [2020-01-16 18:12:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:30,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:30,375 INFO L225 Difference]: With dead ends: 1185 [2020-01-16 18:12:30,375 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:12:30,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:12:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:12:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:12:30,396 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:12:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:30,396 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:12:30,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:12:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:30,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:30,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:30,397 INFO L426 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1690116225, now seen corresponding path program 920 times [2020-01-16 18:12:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:30,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501423703] [2020-01-16 18:12:30,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:30,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501423703] [2020-01-16 18:12:30,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:30,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:30,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564977389] [2020-01-16 18:12:30,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:30,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:30,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:30,833 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:12:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:30,980 INFO L93 Difference]: Finished difference Result 1184 states and 4196 transitions. [2020-01-16 18:12:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:30,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:30,984 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:12:30,984 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:12:30,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:12:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:12:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:12:31,006 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:31,006 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:12:31,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:12:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:31,008 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:31,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] [2020-01-16 18:12:31,008 INFO L426 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 738298073, now seen corresponding path program 921 times [2020-01-16 18:12:31,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:31,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809884] [2020-01-16 18:12:31,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:31,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809884] [2020-01-16 18:12:31,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:31,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:31,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597721453] [2020-01-16 18:12:31,432 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:31,433 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:31,580 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-01-16 18:12:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:31,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:31,584 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:12:31,584 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:12:31,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:12:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:12:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:12:31,605 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:31,605 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:12:31,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:12:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:31,607 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:31,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:31,607 INFO L426 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1761065207, now seen corresponding path program 922 times [2020-01-16 18:12:31,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347546342] [2020-01-16 18:12:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:32,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347546342] [2020-01-16 18:12:32,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:32,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:32,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810499111] [2020-01-16 18:12:32,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:32,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:32,026 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:32,214 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-01-16 18:12:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:32,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:32,217 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:12:32,218 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:12:32,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:12:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:12:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:32,238 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:32,238 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:32,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:32,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:32,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:32,240 INFO L426 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -49106143, now seen corresponding path program 923 times [2020-01-16 18:12:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:32,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819745144] [2020-01-16 18:12:32,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:32,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-01-16 18:12:32,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819745144] [2020-01-16 18:12:32,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:32,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:32,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747597557] [2020-01-16 18:12:32,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:32,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:32,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:32,672 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:32,835 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-01-16 18:12:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:32,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:32,838 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:12:32,838 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:12:32,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:12:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:12:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:32,859 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:32,859 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:32,859 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:32,860 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:32,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:32,860 INFO L426 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2099690393, now seen corresponding path program 924 times [2020-01-16 18:12:32,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:32,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332386586] [2020-01-16 18:12:32,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:33,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332386586] [2020-01-16 18:12:33,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:33,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:33,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354438997] [2020-01-16 18:12:33,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:33,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:33,287 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:33,475 INFO L93 Difference]: Finished difference Result 1180 states and 4184 transitions. [2020-01-16 18:12:33,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:33,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:33,478 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:12:33,479 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:12:33,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:12:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:12:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:12:33,499 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:12:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:33,499 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:12:33,500 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:12:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:33,501 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:33,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:33,501 INFO L426 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1167322591, now seen corresponding path program 925 times [2020-01-16 18:12:33,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:33,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852872909] [2020-01-16 18:12:33,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:33,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-01-16 18:12:33,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852872909] [2020-01-16 18:12:33,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:33,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:33,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434479650] [2020-01-16 18:12:33,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:33,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:33,918 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:12:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:34,078 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-01-16 18:12:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:34,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:34,081 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:12:34,081 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:34,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:12:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:12:34,103 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:12:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:34,103 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:12:34,103 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:12:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:34,104 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:34,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:34,104 INFO L426 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash -176064769, now seen corresponding path program 926 times [2020-01-16 18:12:34,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:34,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108269281] [2020-01-16 18:12:34,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:34,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108269281] [2020-01-16 18:12:34,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:34,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:34,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127023880] [2020-01-16 18:12:34,527 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:34,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:34,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:34,528 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:12:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:34,732 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-01-16 18:12:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:34,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:34,735 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:12:34,735 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:34,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:12:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:34,756 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:34,756 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:34,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:34,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:34,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] [2020-01-16 18:12:34,758 INFO L426 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash 315812347, now seen corresponding path program 927 times [2020-01-16 18:12:34,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:34,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448119977] [2020-01-16 18:12:34,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:35,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448119977] [2020-01-16 18:12:35,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:35,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955945648] [2020-01-16 18:12:35,168 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:35,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:35,168 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:35,329 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-01-16 18:12:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:35,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:35,333 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:12:35,333 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:35,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:12:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:35,353 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:35,353 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:35,353 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:35,354 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:35,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:35,354 INFO L426 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1338579481, now seen corresponding path program 928 times [2020-01-16 18:12:35,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053539544] [2020-01-16 18:12:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:35,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-01-16 18:12:35,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053539544] [2020-01-16 18:12:35,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:35,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:35,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888777227] [2020-01-16 18:12:35,759 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:35,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:35,759 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:35,922 INFO L93 Difference]: Finished difference Result 1186 states and 4197 transitions. [2020-01-16 18:12:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:35,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:35,925 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:12:35,925 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:12:35,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:12:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:12:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:12:35,947 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:12:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:35,947 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:12:35,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:12:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:35,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:35,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:35,948 INFO L426 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1464945313, now seen corresponding path program 929 times [2020-01-16 18:12:35,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:35,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825794859] [2020-01-16 18:12:35,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:36,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825794859] [2020-01-16 18:12:36,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:36,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:36,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591805608] [2020-01-16 18:12:36,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:36,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:36,361 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:12:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:36,523 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-01-16 18:12:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:36,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:36,527 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:36,527 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:36,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:12:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:12:36,548 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:36,548 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:12:36,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:12:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:36,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:36,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:36,549 INFO L426 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2002800891, now seen corresponding path program 930 times [2020-01-16 18:12:36,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:36,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545624770] [2020-01-16 18:12:36,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:36,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545624770] [2020-01-16 18:12:36,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:36,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:36,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881611227] [2020-01-16 18:12:36,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:36,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:36,966 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:37,173 INFO L93 Difference]: Finished difference Result 1189 states and 4201 transitions. [2020-01-16 18:12:37,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:37,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:37,177 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:12:37,177 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:12:37,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:12:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-01-16 18:12:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:12:37,198 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:12:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:37,198 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:12:37,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:12:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:37,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:37,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:37,199 INFO L426 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -426732647, now seen corresponding path program 931 times [2020-01-16 18:12:37,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:37,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353368649] [2020-01-16 18:12:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:37,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353368649] [2020-01-16 18:12:37,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:37,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:37,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148612298] [2020-01-16 18:12:37,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:37,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:37,616 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:12:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:37,783 INFO L93 Difference]: Finished difference Result 1190 states and 4207 transitions. [2020-01-16 18:12:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:37,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:37,787 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:12:37,787 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:37,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-01-16 18:12:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:12:37,808 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:37,808 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:12:37,808 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:12:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:37,809 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:37,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:37,809 INFO L426 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1184208311, now seen corresponding path program 932 times [2020-01-16 18:12:37,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:37,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816805628] [2020-01-16 18:12:37,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:38,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-01-16 18:12:38,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816805628] [2020-01-16 18:12:38,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:38,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:38,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729095701] [2020-01-16 18:12:38,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:38,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:38,217 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:38,428 INFO L93 Difference]: Finished difference Result 1194 states and 4212 transitions. [2020-01-16 18:12:38,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:38,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:38,432 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:38,432 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:38,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-01-16 18:12:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:12:38,453 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:12:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:38,453 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:12:38,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:12:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:38,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:38,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:38,455 INFO L426 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:38,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:38,455 INFO L82 PathProgramCache]: Analyzing trace with hash -933078913, now seen corresponding path program 933 times [2020-01-16 18:12:38,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:38,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779574310] [2020-01-16 18:12:38,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:38,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779574310] [2020-01-16 18:12:38,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:38,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:38,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855555718] [2020-01-16 18:12:38,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:38,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:38,869 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:12:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:39,035 INFO L93 Difference]: Finished difference Result 1184 states and 4192 transitions. [2020-01-16 18:12:39,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:39,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:39,038 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:12:39,038 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:12:39,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:12:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:12:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:12:39,059 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:39,060 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:12:39,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:12:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:39,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:39,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:39,061 INFO L426 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1215717623, now seen corresponding path program 934 times [2020-01-16 18:12:39,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:39,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367796139] [2020-01-16 18:12:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:39,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-01-16 18:12:39,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367796139] [2020-01-16 18:12:39,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:39,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:39,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054438202] [2020-01-16 18:12:39,475 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:39,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:39,476 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:39,666 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:12:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:39,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:39,669 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:12:39,669 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:12:39,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:12:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:12:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:12:39,689 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:12:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:39,690 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:12:39,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:12:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:39,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:39,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:39,691 INFO L426 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:39,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash -922575809, now seen corresponding path program 935 times [2020-01-16 18:12:39,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:39,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225971455] [2020-01-16 18:12:39,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:40,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225971455] [2020-01-16 18:12:40,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:40,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320674450] [2020-01-16 18:12:40,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:40,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:40,106 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:12:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:40,267 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-01-16 18:12:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:40,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:40,270 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:12:40,271 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:12:40,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:12:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:12:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:12:40,292 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:12:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:40,292 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:12:40,292 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:12:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:40,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:40,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] [2020-01-16 18:12:40,293 INFO L426 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -384720231, now seen corresponding path program 936 times [2020-01-16 18:12:40,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:40,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190283617] [2020-01-16 18:12:40,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:40,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190283617] [2020-01-16 18:12:40,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:40,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113595688] [2020-01-16 18:12:40,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:40,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:40,705 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:12:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:40,925 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-01-16 18:12:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:40,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:40,929 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:12:40,929 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:12:40,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:12:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 771. [2020-01-16 18:12:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:12:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:12:40,964 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:12:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:40,964 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:12:40,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:12:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:40,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:40,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:40,966 INFO L426 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -241103101, now seen corresponding path program 937 times [2020-01-16 18:12:40,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:40,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371687758] [2020-01-16 18:12:40,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:41,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371687758] [2020-01-16 18:12:41,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:41,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:41,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522775897] [2020-01-16 18:12:41,384 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:41,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:41,384 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:12:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:41,535 INFO L93 Difference]: Finished difference Result 1206 states and 4252 transitions. [2020-01-16 18:12:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:41,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:41,539 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:12:41,539 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:12:41,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:12:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 779. [2020-01-16 18:12:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:12:41,559 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:12:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:41,559 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:12:41,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:12:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:41,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:41,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:41,561 INFO L426 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1369837857, now seen corresponding path program 938 times [2020-01-16 18:12:41,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:41,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984601392] [2020-01-16 18:12:41,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:41,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984601392] [2020-01-16 18:12:41,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:41,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:41,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797884157] [2020-01-16 18:12:41,983 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:41,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:41,983 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:12:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:42,162 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-01-16 18:12:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:42,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:42,165 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:12:42,166 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:12:42,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:12:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-01-16 18:12:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:12:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:12:42,187 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:42,187 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:12:42,187 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:12:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:42,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:42,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] [2020-01-16 18:12:42,188 INFO L426 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1841540955, now seen corresponding path program 939 times [2020-01-16 18:12:42,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:42,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375717155] [2020-01-16 18:12:42,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:42,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375717155] [2020-01-16 18:12:42,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:42,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:42,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258192301] [2020-01-16 18:12:42,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:42,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:42,615 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:42,771 INFO L93 Difference]: Finished difference Result 1213 states and 4266 transitions. [2020-01-16 18:12:42,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:42,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:42,774 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:12:42,775 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:12:42,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:12:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-01-16 18:12:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:12:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:12:42,795 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:12:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:42,795 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:12:42,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:12:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:42,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:42,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:42,797 INFO L426 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:42,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1380340961, now seen corresponding path program 940 times [2020-01-16 18:12:42,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:42,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474335655] [2020-01-16 18:12:42,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:43,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-01-16 18:12:43,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474335655] [2020-01-16 18:12:43,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:43,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:43,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108976094] [2020-01-16 18:12:43,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:43,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:43,236 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:12:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:43,419 INFO L93 Difference]: Finished difference Result 1214 states and 4262 transitions. [2020-01-16 18:12:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:43,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:43,422 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:12:43,422 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:12:43,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:12:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-01-16 18:12:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:12:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:12:43,443 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:12:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:43,443 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:12:43,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:12:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:43,444 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:43,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:43,444 INFO L426 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1831037851, now seen corresponding path program 941 times [2020-01-16 18:12:43,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:43,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878478673] [2020-01-16 18:12:43,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:43,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878478673] [2020-01-16 18:12:43,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:43,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:43,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122559188] [2020-01-16 18:12:43,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:43,875 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:12:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:44,033 INFO L93 Difference]: Finished difference Result 1204 states and 4242 transitions. [2020-01-16 18:12:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:44,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:44,037 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:12:44,037 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:12:44,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:12:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 779. [2020-01-16 18:12:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:12:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:12:44,058 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:44,058 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:12:44,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:12:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:44,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:44,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:44,059 INFO L426 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -220096893, now seen corresponding path program 942 times [2020-01-16 18:12:44,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:44,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513932940] [2020-01-16 18:12:44,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:44,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513932940] [2020-01-16 18:12:44,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:44,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:44,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442087005] [2020-01-16 18:12:44,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:44,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:44,494 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:44,672 INFO L93 Difference]: Finished difference Result 1208 states and 4247 transitions. [2020-01-16 18:12:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:44,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:44,676 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:12:44,676 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:44,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-01-16 18:12:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:12:44,697 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:12:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:44,697 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:12:44,697 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:12:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:44,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:44,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] [2020-01-16 18:12:44,699 INFO L426 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031837, now seen corresponding path program 943 times [2020-01-16 18:12:44,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061573033] [2020-01-16 18:12:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:45,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061573033] [2020-01-16 18:12:45,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:45,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:45,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235711490] [2020-01-16 18:12:45,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:45,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:45,119 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:12:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:45,321 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-01-16 18:12:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:45,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:45,325 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:12:45,325 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:12:45,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:12:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 778. [2020-01-16 18:12:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:12:45,347 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:12:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:45,347 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:12:45,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:12:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:45,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:45,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:45,348 INFO L426 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1441994501, now seen corresponding path program 944 times [2020-01-16 18:12:45,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:45,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419551786] [2020-01-16 18:12:45,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:45,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419551786] [2020-01-16 18:12:45,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:45,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289388876] [2020-01-16 18:12:45,770 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:45,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:45,771 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:12:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:45,930 INFO L93 Difference]: Finished difference Result 1192 states and 4212 transitions. [2020-01-16 18:12:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:45,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:45,933 INFO L225 Difference]: With dead ends: 1192 [2020-01-16 18:12:45,934 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:12:45,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:12:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:12:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:12:45,955 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:12:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:45,955 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:12:45,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:12:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:45,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:45,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] [2020-01-16 18:12:45,956 INFO L426 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:45,956 INFO L82 PathProgramCache]: Analyzing trace with hash -864752283, now seen corresponding path program 945 times [2020-01-16 18:12:45,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:45,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185875257] [2020-01-16 18:12:45,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:46,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185875257] [2020-01-16 18:12:46,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:46,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:46,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056646146] [2020-01-16 18:12:46,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:46,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:46,371 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:12:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:46,534 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:12:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:46,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:46,538 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:12:46,538 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:12:46,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:12:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:12:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:12:46,559 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:46,559 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:12:46,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:12:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:46,560 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:46,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:46,560 INFO L426 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1399982085, now seen corresponding path program 946 times [2020-01-16 18:12:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58203443] [2020-01-16 18:12:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58203443] [2020-01-16 18:12:46,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:46,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:46,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846773343] [2020-01-16 18:12:46,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:46,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:46,981 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:47,142 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-01-16 18:12:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:47,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:47,146 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:12:47,146 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:12:47,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:12:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:12:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:12:47,167 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:12:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:47,168 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:12:47,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:12:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:47,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:47,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:47,169 INFO L426 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -854249179, now seen corresponding path program 947 times [2020-01-16 18:12:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:47,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210998606] [2020-01-16 18:12:47,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:47,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210998606] [2020-01-16 18:12:47,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:47,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:47,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471761694] [2020-01-16 18:12:47,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:47,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:47,591 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:12:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:47,745 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-01-16 18:12:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:47,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:47,749 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:12:47,749 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:12:47,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:12:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:12:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:12:47,780 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:47,780 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:12:47,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:12:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:47,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:47,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:47,781 INFO L426 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1294547357, now seen corresponding path program 948 times [2020-01-16 18:12:47,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:47,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924119082] [2020-01-16 18:12:47,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:48,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924119082] [2020-01-16 18:12:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325423709] [2020-01-16 18:12:48,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:48,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:48,202 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:48,359 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-01-16 18:12:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:48,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:48,362 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:12:48,362 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:12:48,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:12:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:12:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:12:48,383 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:12:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:48,383 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:12:48,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:12:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:48,384 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:48,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:48,384 INFO L426 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1567628061, now seen corresponding path program 949 times [2020-01-16 18:12:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:48,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490322824] [2020-01-16 18:12:48,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:48,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490322824] [2020-01-16 18:12:48,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:48,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:48,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483278771] [2020-01-16 18:12:48,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:48,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:48,806 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:12:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:48,959 INFO L93 Difference]: Finished difference Result 1209 states and 4253 transitions. [2020-01-16 18:12:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:48,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:48,963 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:12:48,963 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:12:48,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:12:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:12:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:12:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:12:48,984 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:12:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:48,984 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:12:48,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:12:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:48,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:48,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:48,986 INFO L426 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 494542681, now seen corresponding path program 950 times [2020-01-16 18:12:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:48,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034125417] [2020-01-16 18:12:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:49,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034125417] [2020-01-16 18:12:49,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:49,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:49,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131059506] [2020-01-16 18:12:49,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:49,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:49,397 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:12:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:49,551 INFO L93 Difference]: Finished difference Result 1210 states and 4249 transitions. [2020-01-16 18:12:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:49,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:49,554 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:12:49,554 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:12:49,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:12:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-01-16 18:12:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:12:49,576 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:12:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:49,576 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:12:49,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:12:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:49,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:49,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:49,577 INFO L426 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1061281795, now seen corresponding path program 951 times [2020-01-16 18:12:49,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084704370] [2020-01-16 18:12:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:49,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084704370] [2020-01-16 18:12:49,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:49,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:49,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763544638] [2020-01-16 18:12:49,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:49,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:49,985 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:12:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:50,144 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:12:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:50,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:50,148 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:12:50,148 INFO L226 Difference]: Without dead ends: 1185 [2020-01-16 18:12:50,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-01-16 18:12:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 777. [2020-01-16 18:12:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:12:50,169 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:12:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:50,169 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:12:50,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:12:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:50,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:50,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:50,170 INFO L426 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 526051993, now seen corresponding path program 952 times [2020-01-16 18:12:50,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:50,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727452413] [2020-01-16 18:12:50,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:50,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727452413] [2020-01-16 18:12:50,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:50,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:50,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943096284] [2020-01-16 18:12:50,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:50,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:50,581 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:12:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:50,734 INFO L93 Difference]: Finished difference Result 1196 states and 4219 transitions. [2020-01-16 18:12:50,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:50,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:50,738 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:12:50,738 INFO L226 Difference]: Without dead ends: 1183 [2020-01-16 18:12:50,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-01-16 18:12:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-01-16 18:12:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:12:50,760 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:12:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:50,760 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:12:50,760 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:12:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:50,761 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:50,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:50,761 INFO L426 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1082288003, now seen corresponding path program 953 times [2020-01-16 18:12:50,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:50,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322928407] [2020-01-16 18:12:50,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:51,186 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:12:51,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-01-16 18:12:51,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322928407] [2020-01-16 18:12:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293221821] [2020-01-16 18:12:51,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:51,193 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:12:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:51,350 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-01-16 18:12:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:51,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:51,354 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:12:51,354 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:51,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:12:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:12:51,374 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:12:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:51,375 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:12:51,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:12:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:51,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:51,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] [2020-01-16 18:12:51,376 INFO L426 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1620143581, now seen corresponding path program 954 times [2020-01-16 18:12:51,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:51,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060906338] [2020-01-16 18:12:51,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:51,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060906338] [2020-01-16 18:12:51,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:51,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:51,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450561362] [2020-01-16 18:12:51,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:51,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:51,790 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:12:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:51,958 INFO L93 Difference]: Finished difference Result 1197 states and 4219 transitions. [2020-01-16 18:12:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:51,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:51,961 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:12:51,961 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:51,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-01-16 18:12:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:12:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:12:51,983 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:12:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:51,983 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:12:51,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:12:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:51,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:51,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] [2020-01-16 18:12:51,984 INFO L426 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash -790802053, now seen corresponding path program 955 times [2020-01-16 18:12:51,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:51,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863882107] [2020-01-16 18:12:51,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:52,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-01-16 18:12:52,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863882107] [2020-01-16 18:12:52,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:52,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:52,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388584920] [2020-01-16 18:12:52,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:52,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:52,398 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:12:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:52,540 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-01-16 18:12:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:52,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:52,544 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:12:52,544 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:12:52,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:12:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 778. [2020-01-16 18:12:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:12:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:12:52,565 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:12:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:52,565 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:12:52,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:12:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:52,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:52,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:52,567 INFO L426 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 820138905, now seen corresponding path program 956 times [2020-01-16 18:12:52,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:52,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697686427] [2020-01-16 18:12:52,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:52,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697686427] [2020-01-16 18:12:52,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:52,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:52,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764248060] [2020-01-16 18:12:52,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:52,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:52,984 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:12:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:53,135 INFO L93 Difference]: Finished difference Result 1198 states and 4220 transitions. [2020-01-16 18:12:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:53,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:53,139 INFO L225 Difference]: With dead ends: 1198 [2020-01-16 18:12:53,139 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:12:53,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:12:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 775. [2020-01-16 18:12:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:12:53,159 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:12:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:53,159 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:12:53,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:12:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:53,160 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:53,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:53,161 INFO L426 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1297148319, now seen corresponding path program 957 times [2020-01-16 18:12:53,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:53,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497806919] [2020-01-16 18:12:53,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:53,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-01-16 18:12:53,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497806919] [2020-01-16 18:12:53,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:53,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:53,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196846469] [2020-01-16 18:12:53,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:53,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:53,580 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:12:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:53,721 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-01-16 18:12:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:53,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:53,725 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:12:53,725 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:12:53,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:12:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:12:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:12:53,745 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:12:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:53,745 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:12:53,745 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:12:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:53,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:53,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:53,746 INFO L426 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 851648217, now seen corresponding path program 958 times [2020-01-16 18:12:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:53,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404245411] [2020-01-16 18:12:53,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:54,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404245411] [2020-01-16 18:12:54,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:54,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:54,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708232101] [2020-01-16 18:12:54,168 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:54,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:54,168 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:12:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:54,326 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-01-16 18:12:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:54,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:54,329 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:12:54,329 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:12:54,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:12:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:12:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:12:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:12:54,350 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:12:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:54,350 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:12:54,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:12:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:54,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:54,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:54,351 INFO L426 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1286645215, now seen corresponding path program 959 times [2020-01-16 18:12:54,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:54,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607571829] [2020-01-16 18:12:54,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:54,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607571829] [2020-01-16 18:12:54,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:54,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:54,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353170778] [2020-01-16 18:12:54,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:54,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:54,785 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:12:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:54,927 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-01-16 18:12:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:54,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:54,930 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:12:54,931 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:12:54,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:12:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:12:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:12:54,951 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:12:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:54,951 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:12:54,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:12:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:54,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:54,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:54,952 INFO L426 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash -748789637, now seen corresponding path program 960 times [2020-01-16 18:12:54,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:54,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105772799] [2020-01-16 18:12:54,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:55,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105772799] [2020-01-16 18:12:55,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:55,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:55,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088965129] [2020-01-16 18:12:55,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:55,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:55,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:55,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:55,367 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:12:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:55,526 INFO L93 Difference]: Finished difference Result 1191 states and 4202 transitions. [2020-01-16 18:12:55,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:55,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:55,529 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:12:55,529 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:12:55,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:12:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 769. [2020-01-16 18:12:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:12:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3074 transitions. [2020-01-16 18:12:55,549 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3074 transitions. Word has length 25 [2020-01-16 18:12:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:55,550 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3074 transitions. [2020-01-16 18:12:55,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3074 transitions. [2020-01-16 18:12:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:55,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:55,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] [2020-01-16 18:12:55,551 INFO L426 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash 377256515, now seen corresponding path program 961 times [2020-01-16 18:12:55,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:55,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113932822] [2020-01-16 18:12:55,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:55,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113932822] [2020-01-16 18:12:55,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:55,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:55,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658210193] [2020-01-16 18:12:55,986 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:55,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:55,987 INFO L87 Difference]: Start difference. First operand 769 states and 3074 transitions. Second operand 10 states. [2020-01-16 18:12:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:56,135 INFO L93 Difference]: Finished difference Result 1207 states and 4273 transitions. [2020-01-16 18:12:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:56,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:56,139 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:12:56,139 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:12:56,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:12:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-01-16 18:12:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:12:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3117 transitions. [2020-01-16 18:12:56,160 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3117 transitions. Word has length 25 [2020-01-16 18:12:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:56,160 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3117 transitions. [2020-01-16 18:12:56,160 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3117 transitions. [2020-01-16 18:12:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:56,161 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:56,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:56,161 INFO L426 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1347508129, now seen corresponding path program 962 times [2020-01-16 18:12:56,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:56,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471985731] [2020-01-16 18:12:56,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:56,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471985731] [2020-01-16 18:12:56,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:56,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:56,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857189820] [2020-01-16 18:12:56,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:56,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:56,592 INFO L87 Difference]: Start difference. First operand 781 states and 3117 transitions. Second operand 10 states. [2020-01-16 18:12:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:56,757 INFO L93 Difference]: Finished difference Result 1209 states and 4273 transitions. [2020-01-16 18:12:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:56,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:56,761 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:12:56,761 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:12:56,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:12:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:12:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3107 transitions. [2020-01-16 18:12:56,784 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3107 transitions. Word has length 25 [2020-01-16 18:12:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:56,784 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3107 transitions. [2020-01-16 18:12:56,784 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3107 transitions. [2020-01-16 18:12:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:56,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:56,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:56,785 INFO L426 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1991676703, now seen corresponding path program 963 times [2020-01-16 18:12:56,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:56,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346572977] [2020-01-16 18:12:56,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:57,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346572977] [2020-01-16 18:12:57,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:57,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:57,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215723520] [2020-01-16 18:12:57,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:57,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:57,231 INFO L87 Difference]: Start difference. First operand 777 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:12:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:57,390 INFO L93 Difference]: Finished difference Result 1203 states and 4261 transitions. [2020-01-16 18:12:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:57,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:57,393 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:12:57,393 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:12:57,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:12:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-01-16 18:12:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:12:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-01-16 18:12:57,415 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-01-16 18:12:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:57,415 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-01-16 18:12:57,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-01-16 18:12:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:57,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:57,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:57,416 INFO L426 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1010921985, now seen corresponding path program 964 times [2020-01-16 18:12:57,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:57,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322366455] [2020-01-16 18:12:57,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:57,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-01-16 18:12:57,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322366455] [2020-01-16 18:12:57,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:57,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:57,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20800098] [2020-01-16 18:12:57,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:57,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:57,855 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:12:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:58,011 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-01-16 18:12:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:58,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:58,015 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:12:58,015 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:12:58,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:12:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-01-16 18:12:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:12:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3104 transitions. [2020-01-16 18:12:58,037 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3104 transitions. Word has length 25 [2020-01-16 18:12:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:58,037 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3104 transitions. [2020-01-16 18:12:58,037 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3104 transitions. [2020-01-16 18:12:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:58,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:58,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:58,049 INFO L426 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1686133315, now seen corresponding path program 965 times [2020-01-16 18:12:58,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:58,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434096652] [2020-01-16 18:12:58,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:58,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434096652] [2020-01-16 18:12:58,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:58,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:58,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984169095] [2020-01-16 18:12:58,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:58,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:58,497 INFO L87 Difference]: Start difference. First operand 777 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:12:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:58,645 INFO L93 Difference]: Finished difference Result 1207 states and 4266 transitions. [2020-01-16 18:12:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:58,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:58,649 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:12:58,649 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:12:58,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:12:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-01-16 18:12:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:12:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-01-16 18:12:58,670 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-01-16 18:12:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:58,670 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-01-16 18:12:58,670 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-01-16 18:12:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:58,671 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:58,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:58,671 INFO L426 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash -997893023, now seen corresponding path program 966 times [2020-01-16 18:12:58,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:58,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615015730] [2020-01-16 18:12:58,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:59,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615015730] [2020-01-16 18:12:59,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:59,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:59,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327793227] [2020-01-16 18:12:59,114 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:59,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:59,114 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:12:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:59,274 INFO L93 Difference]: Finished difference Result 1204 states and 4257 transitions. [2020-01-16 18:12:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:59,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:59,277 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:12:59,278 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:12:59,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:12:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-01-16 18:12:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:12:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3096 transitions. [2020-01-16 18:12:59,299 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3096 transitions. Word has length 25 [2020-01-16 18:12:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:59,299 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3096 transitions. [2020-01-16 18:12:59,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3096 transitions. [2020-01-16 18:12:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:59,300 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:59,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:59,300 INFO L426 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash -467714937, now seen corresponding path program 967 times [2020-01-16 18:12:59,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:59,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998157373] [2020-01-16 18:12:59,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:12:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:12:59,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998157373] [2020-01-16 18:12:59,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:12:59,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:12:59,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177148338] [2020-01-16 18:12:59,734 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:12:59,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:12:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:12:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:12:59,734 INFO L87 Difference]: Start difference. First operand 774 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:12:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:12:59,879 INFO L93 Difference]: Finished difference Result 1213 states and 4287 transitions. [2020-01-16 18:12:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:12:59,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:12:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:12:59,883 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:12:59,883 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:12:59,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:12:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:12:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 782. [2020-01-16 18:12:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:12:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-01-16 18:12:59,905 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-01-16 18:12:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:12:59,906 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-01-16 18:12:59,906 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:12:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-01-16 18:12:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:12:59,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:12:59,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:12:59,907 INFO L426 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:12:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:12:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash 502536677, now seen corresponding path program 968 times [2020-01-16 18:12:59,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:12:59,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326837870] [2020-01-16 18:12:59,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:12:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:00,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-01-16 18:13:00,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326837870] [2020-01-16 18:13:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179833525] [2020-01-16 18:13:00,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:00,352 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-01-16 18:13:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:00,506 INFO L93 Difference]: Finished difference Result 1215 states and 4287 transitions. [2020-01-16 18:13:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:00,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:00,510 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:13:00,510 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:13:00,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:13:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 778. [2020-01-16 18:13:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3107 transitions. [2020-01-16 18:13:00,532 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3107 transitions. Word has length 25 [2020-01-16 18:13:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:00,532 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3107 transitions. [2020-01-16 18:13:00,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3107 transitions. [2020-01-16 18:13:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:00,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:00,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] [2020-01-16 18:13:00,533 INFO L426 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1015420001, now seen corresponding path program 969 times [2020-01-16 18:13:00,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:00,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353183051] [2020-01-16 18:13:00,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:00,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353183051] [2020-01-16 18:13:00,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:00,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:00,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587110758] [2020-01-16 18:13:00,980 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:00,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:00,980 INFO L87 Difference]: Start difference. First operand 778 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:13:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:01,135 INFO L93 Difference]: Finished difference Result 1212 states and 4281 transitions. [2020-01-16 18:13:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:01,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:01,139 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:13:01,139 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:13:01,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:13:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 782. [2020-01-16 18:13:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:13:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3114 transitions. [2020-01-16 18:13:01,160 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3114 transitions. Word has length 25 [2020-01-16 18:13:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:01,160 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3114 transitions. [2020-01-16 18:13:01,160 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3114 transitions. [2020-01-16 18:13:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:01,161 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:01,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:01,161 INFO L426 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2017180927, now seen corresponding path program 970 times [2020-01-16 18:13:01,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:01,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754951373] [2020-01-16 18:13:01,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:01,616 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2020-01-16 18:13:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:01,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754951373] [2020-01-16 18:13:01,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:01,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:01,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755091968] [2020-01-16 18:13:01,619 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:01,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:01,620 INFO L87 Difference]: Start difference. First operand 782 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:13:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:01,774 INFO L93 Difference]: Finished difference Result 1213 states and 4279 transitions. [2020-01-16 18:13:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:01,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:01,778 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:13:01,778 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:13:01,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:13:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-01-16 18:13:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3103 transitions. [2020-01-16 18:13:01,799 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3103 transitions. Word has length 25 [2020-01-16 18:13:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:01,800 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3103 transitions. [2020-01-16 18:13:01,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3103 transitions. [2020-01-16 18:13:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:01,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:01,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:01,801 INFO L426 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1492354311, now seen corresponding path program 971 times [2020-01-16 18:13:01,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:01,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892724460] [2020-01-16 18:13:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:02,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892724460] [2020-01-16 18:13:02,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:02,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:02,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118283161] [2020-01-16 18:13:02,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:02,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:02,246 INFO L87 Difference]: Start difference. First operand 778 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:13:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:02,408 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-01-16 18:13:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:02,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:02,411 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:13:02,411 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:13:02,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:13:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 783. [2020-01-16 18:13:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:13:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:13:02,433 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:13:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:02,433 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:13:02,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:13:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:02,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:02,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:02,434 INFO L426 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2030209889, now seen corresponding path program 972 times [2020-01-16 18:13:02,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:02,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749225614] [2020-01-16 18:13:02,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:02,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-01-16 18:13:02,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749225614] [2020-01-16 18:13:02,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:02,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:02,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622325720] [2020-01-16 18:13:02,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:02,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:02,872 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:13:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:03,022 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:13:03,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:03,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:03,025 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:13:03,026 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:13:03,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:13:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 774. [2020-01-16 18:13:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:13:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3093 transitions. [2020-01-16 18:13:03,047 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3093 transitions. Word has length 25 [2020-01-16 18:13:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:03,047 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3093 transitions. [2020-01-16 18:13:03,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3093 transitions. [2020-01-16 18:13:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:03,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:03,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] [2020-01-16 18:13:03,048 INFO L426 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1035833415, now seen corresponding path program 973 times [2020-01-16 18:13:03,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:03,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107163244] [2020-01-16 18:13:03,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:03,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107163244] [2020-01-16 18:13:03,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:03,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:03,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852568344] [2020-01-16 18:13:03,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:03,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:03,498 INFO L87 Difference]: Start difference. First operand 774 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:13:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:03,673 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-01-16 18:13:03,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:03,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:03,677 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:13:03,677 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:13:03,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:13:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-01-16 18:13:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-01-16 18:13:03,699 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-01-16 18:13:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:03,699 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-01-16 18:13:03,699 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-01-16 18:13:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:03,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:03,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:03,700 INFO L426 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2016588133, now seen corresponding path program 974 times [2020-01-16 18:13:03,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:03,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713047738] [2020-01-16 18:13:03,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:04,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-01-16 18:13:04,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713047738] [2020-01-16 18:13:04,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:04,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:04,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321146549] [2020-01-16 18:13:04,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:04,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:04,147 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:13:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:04,303 INFO L93 Difference]: Finished difference Result 1201 states and 4251 transitions. [2020-01-16 18:13:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:04,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:04,307 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:13:04,307 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:13:04,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:13:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-01-16 18:13:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:13:04,329 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:13:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:04,329 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:13:04,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:13:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:04,330 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:04,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:04,330 INFO L426 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash 592934275, now seen corresponding path program 975 times [2020-01-16 18:13:04,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:04,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042663599] [2020-01-16 18:13:04,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:04,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042663599] [2020-01-16 18:13:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289986091] [2020-01-16 18:13:04,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:04,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:04,775 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:13:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:04,933 INFO L93 Difference]: Finished difference Result 1205 states and 4260 transitions. [2020-01-16 18:13:04,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:04,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:04,937 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:13:04,937 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:13:04,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:13:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-01-16 18:13:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:13:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:13:04,958 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:13:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:04,958 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:13:04,959 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:13:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:04,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:04,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:04,960 INFO L426 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1594695201, now seen corresponding path program 976 times [2020-01-16 18:13:04,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:04,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77266130] [2020-01-16 18:13:04,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:05,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-01-16 18:13:05,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77266130] [2020-01-16 18:13:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:05,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38076439] [2020-01-16 18:13:05,417 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:05,417 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:13:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:05,593 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-01-16 18:13:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:05,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:05,597 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:13:05,597 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:13:05,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:13:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-01-16 18:13:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:13:05,617 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:05,618 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:13:05,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:13:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:05,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:05,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:05,619 INFO L426 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1288561529, now seen corresponding path program 977 times [2020-01-16 18:13:05,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:05,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299270712] [2020-01-16 18:13:05,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:06,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299270712] [2020-01-16 18:13:06,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:06,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:06,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474495764] [2020-01-16 18:13:06,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:06,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:06,057 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:06,233 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-01-16 18:13:06,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:06,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:06,237 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:13:06,237 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:13:06,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:13:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-01-16 18:13:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:13:06,259 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:13:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:06,259 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:13:06,259 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:13:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:06,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:06,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:06,261 INFO L426 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:06,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1933320387, now seen corresponding path program 978 times [2020-01-16 18:13:06,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:06,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119224998] [2020-01-16 18:13:06,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:06,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119224998] [2020-01-16 18:13:06,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:06,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:06,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482007609] [2020-01-16 18:13:06,696 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:06,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:06,696 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:13:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:06,860 INFO L93 Difference]: Finished difference Result 1204 states and 4251 transitions. [2020-01-16 18:13:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:06,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:06,864 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:13:06,864 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:13:06,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:13:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 774. [2020-01-16 18:13:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-01-16 18:13:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-01-16 18:13:06,885 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-01-16 18:13:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:06,885 INFO L478 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-01-16 18:13:06,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-01-16 18:13:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:06,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:06,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:06,886 INFO L426 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258399, now seen corresponding path program 979 times [2020-01-16 18:13:06,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:06,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266323699] [2020-01-16 18:13:06,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:07,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266323699] [2020-01-16 18:13:07,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:07,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:07,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635015688] [2020-01-16 18:13:07,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:07,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:07,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:07,326 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:13:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:07,476 INFO L93 Difference]: Finished difference Result 1209 states and 4268 transitions. [2020-01-16 18:13:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:07,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:07,480 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:13:07,480 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:13:07,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:13:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 780. [2020-01-16 18:13:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-01-16 18:13:07,501 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-01-16 18:13:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:07,501 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-01-16 18:13:07,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-01-16 18:13:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:07,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:07,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:07,502 INFO L426 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:07,502 INFO L82 PathProgramCache]: Analyzing trace with hash -378317441, now seen corresponding path program 980 times [2020-01-16 18:13:07,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:07,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996528539] [2020-01-16 18:13:07,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:07,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996528539] [2020-01-16 18:13:07,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:07,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:07,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144568030] [2020-01-16 18:13:07,936 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:07,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:07,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:07,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:07,937 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:13:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:08,122 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-01-16 18:13:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:08,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:08,125 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:13:08,126 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:13:08,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:13:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:13:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:13:08,147 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:08,147 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:13:08,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:13:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:08,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:08,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:08,148 INFO L426 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash -895166811, now seen corresponding path program 981 times [2020-01-16 18:13:08,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:08,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391402532] [2020-01-16 18:13:08,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:08,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391402532] [2020-01-16 18:13:08,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:08,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:08,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333488583] [2020-01-16 18:13:08,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:08,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:08,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:08,589 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:08,740 INFO L93 Difference]: Finished difference Result 1213 states and 4275 transitions. [2020-01-16 18:13:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:08,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:08,744 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:13:08,744 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:13:08,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:13:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-01-16 18:13:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:13:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-01-16 18:13:08,775 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-01-16 18:13:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:08,775 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-01-16 18:13:08,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-01-16 18:13:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:08,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:08,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:08,777 INFO L426 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash -357311233, now seen corresponding path program 982 times [2020-01-16 18:13:08,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:08,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455361075] [2020-01-16 18:13:08,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:09,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455361075] [2020-01-16 18:13:09,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:09,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:09,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260404030] [2020-01-16 18:13:09,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:09,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:09,215 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:13:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:09,389 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:13:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:09,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:09,392 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:13:09,392 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:13:09,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:13:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:13:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:13:09,414 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:13:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:09,414 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:13:09,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:13:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:09,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:09,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] [2020-01-16 18:13:09,415 INFO L426 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -884663707, now seen corresponding path program 983 times [2020-01-16 18:13:09,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:09,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938913730] [2020-01-16 18:13:09,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:09,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938913730] [2020-01-16 18:13:09,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:09,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:09,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562069667] [2020-01-16 18:13:09,858 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:09,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:09,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:09,858 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:13:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:10,011 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-01-16 18:13:10,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:10,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:10,014 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:13:10,015 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:13:10,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:13:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-01-16 18:13:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:13:10,036 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:13:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:10,036 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:13:10,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:13:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:10,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:10,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] [2020-01-16 18:13:10,037 INFO L426 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1957749087, now seen corresponding path program 984 times [2020-01-16 18:13:10,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:10,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611554242] [2020-01-16 18:13:10,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:10,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611554242] [2020-01-16 18:13:10,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:10,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:10,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96159106] [2020-01-16 18:13:10,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:10,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:10,469 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:13:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:10,662 INFO L93 Difference]: Finished difference Result 1207 states and 4255 transitions. [2020-01-16 18:13:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:10,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:10,666 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:13:10,666 INFO L226 Difference]: Without dead ends: 1184 [2020-01-16 18:13:10,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-01-16 18:13:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-01-16 18:13:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:13:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-01-16 18:13:10,687 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-01-16 18:13:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:10,687 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-01-16 18:13:10,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-01-16 18:13:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:10,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:10,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:10,689 INFO L426 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash -47054721, now seen corresponding path program 985 times [2020-01-16 18:13:10,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:10,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38460186] [2020-01-16 18:13:10,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:11,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38460186] [2020-01-16 18:13:11,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:11,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334147993] [2020-01-16 18:13:11,121 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:11,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:11,122 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:13:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:11,271 INFO L93 Difference]: Finished difference Result 1193 states and 4226 transitions. [2020-01-16 18:13:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:11,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:11,274 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:11,275 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:13:11,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:13:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 780. [2020-01-16 18:13:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3110 transitions. [2020-01-16 18:13:11,296 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3110 transitions. Word has length 25 [2020-01-16 18:13:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:11,296 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3110 transitions. [2020-01-16 18:13:11,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3110 transitions. [2020-01-16 18:13:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:11,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:11,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:11,298 INFO L426 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 923196893, now seen corresponding path program 986 times [2020-01-16 18:13:11,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:11,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132549083] [2020-01-16 18:13:11,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:11,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-01-16 18:13:11,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132549083] [2020-01-16 18:13:11,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:11,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:11,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651976600] [2020-01-16 18:13:11,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:11,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:11,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:11,727 INFO L87 Difference]: Start difference. First operand 780 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:13:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:11,895 INFO L93 Difference]: Finished difference Result 1195 states and 4226 transitions. [2020-01-16 18:13:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:11,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:11,899 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:13:11,899 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:11,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-01-16 18:13:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-01-16 18:13:11,920 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-01-16 18:13:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:11,920 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-01-16 18:13:11,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-01-16 18:13:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:11,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:11,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:11,921 INFO L426 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1878979357, now seen corresponding path program 987 times [2020-01-16 18:13:11,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:11,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966577121] [2020-01-16 18:13:11,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:12,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966577121] [2020-01-16 18:13:12,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:12,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:12,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354040769] [2020-01-16 18:13:12,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:12,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:12,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:12,359 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:13:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:12,545 INFO L93 Difference]: Finished difference Result 1189 states and 4214 transitions. [2020-01-16 18:13:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:12,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:12,549 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:13:12,549 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:12,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-01-16 18:13:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:13:12,569 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:13:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:12,570 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:13:12,570 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:13:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:12,571 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:12,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:12,571 INFO L426 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1435233221, now seen corresponding path program 988 times [2020-01-16 18:13:12,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:12,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174634659] [2020-01-16 18:13:12,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:13,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174634659] [2020-01-16 18:13:13,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:13,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:13,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357857050] [2020-01-16 18:13:13,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:13,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:13,009 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:13:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:13,205 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-01-16 18:13:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:13,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:13,208 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:13:13,209 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:13:13,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:13:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-01-16 18:13:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3097 transitions. [2020-01-16 18:13:13,230 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3097 transitions. Word has length 25 [2020-01-16 18:13:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:13,230 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3097 transitions. [2020-01-16 18:13:13,230 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3097 transitions. [2020-01-16 18:13:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:13,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:13,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:13,231 INFO L426 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1261822079, now seen corresponding path program 989 times [2020-01-16 18:13:13,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:13,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813825336] [2020-01-16 18:13:13,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:13,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813825336] [2020-01-16 18:13:13,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:13,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:13,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470913630] [2020-01-16 18:13:13,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:13,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:13,657 INFO L87 Difference]: Start difference. First operand 776 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:13:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:13,843 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-01-16 18:13:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:13,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:13,847 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:13,847 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:13:13,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:13:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 779. [2020-01-16 18:13:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:13:13,868 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:13:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:13,868 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:13:13,868 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:13:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:13,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:13,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:13,869 INFO L426 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1422204259, now seen corresponding path program 990 times [2020-01-16 18:13:13,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:13,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479559538] [2020-01-16 18:13:13,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:14,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479559538] [2020-01-16 18:13:14,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:14,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:14,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033113104] [2020-01-16 18:13:14,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:14,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:14,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:14,300 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:13:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:14,512 INFO L93 Difference]: Finished difference Result 1190 states and 4210 transitions. [2020-01-16 18:13:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:14,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:14,516 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:13:14,516 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:13:14,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:13:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:13:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-01-16 18:13:14,538 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-01-16 18:13:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:14,538 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-01-16 18:13:14,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-01-16 18:13:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:14,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:14,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:14,539 INFO L426 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1736997625, now seen corresponding path program 991 times [2020-01-16 18:13:14,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:14,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244158301] [2020-01-16 18:13:14,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:14,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244158301] [2020-01-16 18:13:14,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:14,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:14,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581106593] [2020-01-16 18:13:14,963 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:14,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:14,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:14,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:14,963 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:13:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:15,127 INFO L93 Difference]: Finished difference Result 1189 states and 4212 transitions. [2020-01-16 18:13:15,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:15,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:15,131 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:13:15,131 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:15,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-01-16 18:13:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:13:15,152 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:13:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:15,153 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:13:15,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:13:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:15,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:15,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] [2020-01-16 18:13:15,154 INFO L426 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -766746011, now seen corresponding path program 992 times [2020-01-16 18:13:15,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:15,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580150156] [2020-01-16 18:13:15,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580150156] [2020-01-16 18:13:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:15,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659515291] [2020-01-16 18:13:15,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:15,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:15,575 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:13:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:15,741 INFO L93 Difference]: Finished difference Result 1191 states and 4212 transitions. [2020-01-16 18:13:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:15,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:15,745 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:13:15,745 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:13:15,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:13:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-01-16 18:13:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-01-16 18:13:15,767 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-01-16 18:13:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:15,767 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-01-16 18:13:15,767 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-01-16 18:13:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:15,768 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:15,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] [2020-01-16 18:13:15,768 INFO L426 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash -696761827, now seen corresponding path program 993 times [2020-01-16 18:13:15,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:15,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824542494] [2020-01-16 18:13:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:16,196 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-01-16 18:13:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:16,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824542494] [2020-01-16 18:13:16,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:16,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:16,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885411610] [2020-01-16 18:13:16,200 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:16,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:16,201 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:13:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:16,383 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-01-16 18:13:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:16,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:16,387 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:13:16,387 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:13:16,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:13:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:13:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-01-16 18:13:16,408 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:16,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:16,408 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-01-16 18:13:16,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-01-16 18:13:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:16,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:16,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:16,409 INFO L426 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash 326005307, now seen corresponding path program 994 times [2020-01-16 18:13:16,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:16,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309991266] [2020-01-16 18:13:16,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:16,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309991266] [2020-01-16 18:13:16,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:16,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:16,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581403070] [2020-01-16 18:13:16,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:16,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:16,839 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:17,014 INFO L93 Difference]: Finished difference Result 1181 states and 4190 transitions. [2020-01-16 18:13:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:17,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:17,018 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:17,018 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:13:17,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:13:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:13:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:13:17,038 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:13:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:17,038 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:13:17,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:13:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:17,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:17,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:17,040 INFO L426 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash 874264071, now seen corresponding path program 995 times [2020-01-16 18:13:17,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:17,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229713085] [2020-01-16 18:13:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:17,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229713085] [2020-01-16 18:13:17,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:17,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:17,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676582309] [2020-01-16 18:13:17,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:17,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:17,468 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:13:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:17,624 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:13:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:17,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:17,627 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:17,627 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:13:17,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:13:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:13:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:13:17,648 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:13:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:17,648 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:13:17,648 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:13:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:17,649 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:17,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:17,649 INFO L426 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash 339034269, now seen corresponding path program 996 times [2020-01-16 18:13:17,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:17,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872422123] [2020-01-16 18:13:17,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:18,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872422123] [2020-01-16 18:13:18,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:18,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:18,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337037366] [2020-01-16 18:13:18,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:18,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:18,066 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:13:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:18,224 INFO L93 Difference]: Finished difference Result 1183 states and 4192 transitions. [2020-01-16 18:13:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:18,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:18,228 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:13:18,228 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:13:18,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:13:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-01-16 18:13:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:13:18,250 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:13:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:18,250 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:13:18,250 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:13:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:18,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:18,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:18,251 INFO L426 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash -233449273, now seen corresponding path program 997 times [2020-01-16 18:13:18,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:18,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209499274] [2020-01-16 18:13:18,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:18,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209499274] [2020-01-16 18:13:18,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:18,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:18,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010746439] [2020-01-16 18:13:18,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:18,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:18,690 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:13:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:18,872 INFO L93 Difference]: Finished difference Result 1181 states and 4192 transitions. [2020-01-16 18:13:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:18,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:18,876 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:18,876 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:13:18,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:13:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-01-16 18:13:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-01-16 18:13:18,897 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-01-16 18:13:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:18,897 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-01-16 18:13:18,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-01-16 18:13:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:18,898 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:18,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:18,898 INFO L426 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 747305445, now seen corresponding path program 998 times [2020-01-16 18:13:18,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:18,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500820646] [2020-01-16 18:13:18,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:19,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-01-16 18:13:19,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500820646] [2020-01-16 18:13:19,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:19,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:19,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687564471] [2020-01-16 18:13:19,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:19,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:19,341 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:13:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:19,496 INFO L93 Difference]: Finished difference Result 1180 states and 4187 transitions. [2020-01-16 18:13:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:19,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:19,500 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:13:19,500 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:13:19,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:13:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-01-16 18:13:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:13:19,522 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:13:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:19,522 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:13:19,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:13:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:19,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:19,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:19,523 INFO L426 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:19,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1119247553, now seen corresponding path program 999 times [2020-01-16 18:13:19,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:19,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687717167] [2020-01-16 18:13:19,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:19,967 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-01-16 18:13:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:19,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687717167] [2020-01-16 18:13:19,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:19,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:19,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934837239] [2020-01-16 18:13:19,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:19,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:19,975 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:13:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:20,147 INFO L93 Difference]: Finished difference Result 1179 states and 4185 transitions. [2020-01-16 18:13:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:20,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:20,151 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:13:20,151 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:13:20,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:13:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-01-16 18:13:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:13:20,172 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:13:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:20,172 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:13:20,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:13:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:20,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:20,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] [2020-01-16 18:13:20,173 INFO L426 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:20,173 INFO L82 PathProgramCache]: Analyzing trace with hash -96480419, now seen corresponding path program 1000 times [2020-01-16 18:13:20,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:20,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351736789] [2020-01-16 18:13:20,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:20,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-01-16 18:13:20,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351736789] [2020-01-16 18:13:20,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:20,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:20,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818591369] [2020-01-16 18:13:20,610 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:20,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:20,610 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:13:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:20,766 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-01-16 18:13:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:20,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:20,769 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:13:20,769 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:13:20,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:13:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:13:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:13:20,790 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:20,790 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:13:20,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:13:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:20,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:20,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] [2020-01-16 18:13:20,792 INFO L426 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1906651769, now seen corresponding path program 1001 times [2020-01-16 18:13:20,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:20,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491417617] [2020-01-16 18:13:20,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:21,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-01-16 18:13:21,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491417617] [2020-01-16 18:13:21,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:21,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:21,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096637012] [2020-01-16 18:13:21,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:21,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:21,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:21,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:21,234 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:21,394 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-01-16 18:13:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:21,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:21,398 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:13:21,398 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:13:21,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:13:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:13:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:13:21,418 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:21,419 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:13:21,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:13:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:21,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:21,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:21,420 INFO L426 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 242144767, now seen corresponding path program 1002 times [2020-01-16 18:13:21,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:21,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259241116] [2020-01-16 18:13:21,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:21,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259241116] [2020-01-16 18:13:21,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:21,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:21,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702786549] [2020-01-16 18:13:21,857 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:21,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:21,858 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:22,048 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:13:22,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:22,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:22,052 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:13:22,052 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:13:22,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:13:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-01-16 18:13:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:13:22,074 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:13:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:22,074 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:13:22,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:13:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:22,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:22,075 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:22,075 INFO L426 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 593527069, now seen corresponding path program 1003 times [2020-01-16 18:13:22,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:22,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099641902] [2020-01-16 18:13:22,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:22,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099641902] [2020-01-16 18:13:22,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:22,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485201431] [2020-01-16 18:13:22,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:22,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:22,514 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:13:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:22,694 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-01-16 18:13:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:22,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:22,698 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:22,698 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:13:22,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:13:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:13:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:13:22,719 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:22,719 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:13:22,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:13:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:22,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:22,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:22,720 INFO L426 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2090499269, now seen corresponding path program 1004 times [2020-01-16 18:13:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:22,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394324010] [2020-01-16 18:13:22,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:23,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-01-16 18:13:23,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394324010] [2020-01-16 18:13:23,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:23,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:23,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591963262] [2020-01-16 18:13:23,159 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:23,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:23,160 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:23,327 INFO L93 Difference]: Finished difference Result 1184 states and 4193 transitions. [2020-01-16 18:13:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:23,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:23,330 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:13:23,330 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:13:23,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:13:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:13:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:13:23,351 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:23,352 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:13:23,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:13:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:23,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:23,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:23,353 INFO L426 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1513257051, now seen corresponding path program 1005 times [2020-01-16 18:13:23,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:23,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586262709] [2020-01-16 18:13:23,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:23,796 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:13:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:23,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586262709] [2020-01-16 18:13:23,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:23,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:23,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127599554] [2020-01-16 18:13:23,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:23,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:23,803 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:23,968 INFO L93 Difference]: Finished difference Result 1185 states and 4195 transitions. [2020-01-16 18:13:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:23,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:23,972 INFO L225 Difference]: With dead ends: 1185 [2020-01-16 18:13:23,972 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:13:23,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:13:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:13:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:13:23,993 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:23,993 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:13:23,993 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:13:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:23,994 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:23,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] [2020-01-16 18:13:23,994 INFO L426 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2048486853, now seen corresponding path program 1006 times [2020-01-16 18:13:23,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:23,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628114241] [2020-01-16 18:13:23,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:24,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628114241] [2020-01-16 18:13:24,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:24,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:24,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257820812] [2020-01-16 18:13:24,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:24,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:24,424 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:24,599 INFO L93 Difference]: Finished difference Result 1181 states and 4185 transitions. [2020-01-16 18:13:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:24,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:24,603 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:24,603 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:13:24,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:13:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-01-16 18:13:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:13:24,625 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:13:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:24,625 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:13:24,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:13:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:24,626 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:24,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:24,626 INFO L426 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1502753947, now seen corresponding path program 1007 times [2020-01-16 18:13:24,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:24,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257187030] [2020-01-16 18:13:24,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:25,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257187030] [2020-01-16 18:13:25,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:25,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:25,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734297280] [2020-01-16 18:13:25,071 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:25,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:25,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:25,072 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:13:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:25,244 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-01-16 18:13:25,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:25,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:25,247 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:13:25,247 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:13:25,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:13:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-01-16 18:13:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:13:25,269 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:13:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:25,269 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:13:25,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:13:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:25,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:25,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:25,270 INFO L426 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 646042589, now seen corresponding path program 1008 times [2020-01-16 18:13:25,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124257942] [2020-01-16 18:13:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:25,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124257942] [2020-01-16 18:13:25,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:25,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:25,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318224300] [2020-01-16 18:13:25,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:25,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:25,710 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:13:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:25,897 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-01-16 18:13:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:25,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:25,901 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:13:25,901 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:13:25,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:13:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-01-16 18:13:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:13:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:13:25,922 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:13:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:25,922 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:13:25,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:13:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:25,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:25,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:25,923 INFO L426 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1316337409, now seen corresponding path program 1009 times [2020-01-16 18:13:25,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:25,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752161586] [2020-01-16 18:13:25,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:26,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752161586] [2020-01-16 18:13:26,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:26,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:26,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482907036] [2020-01-16 18:13:26,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:26,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:26,359 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:13:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:26,514 INFO L93 Difference]: Finished difference Result 1205 states and 4258 transitions. [2020-01-16 18:13:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:26,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:26,518 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:13:26,518 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:13:26,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:13:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-01-16 18:13:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:13:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-01-16 18:13:26,539 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-01-16 18:13:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:26,540 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-01-16 18:13:26,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-01-16 18:13:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:26,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:26,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:26,541 INFO L426 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash -346085795, now seen corresponding path program 1010 times [2020-01-16 18:13:26,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:26,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449762127] [2020-01-16 18:13:26,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:26,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449762127] [2020-01-16 18:13:26,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:26,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:26,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134066386] [2020-01-16 18:13:26,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:26,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:26,968 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:13:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:27,138 INFO L93 Difference]: Finished difference Result 1207 states and 4258 transitions. [2020-01-16 18:13:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:27,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:27,142 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:13:27,142 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:13:27,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:13:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-01-16 18:13:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:13:27,163 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:13:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:27,163 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:13:27,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:13:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:27,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:27,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:27,164 INFO L426 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 166797529, now seen corresponding path program 1011 times [2020-01-16 18:13:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:27,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065971244] [2020-01-16 18:13:27,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:27,621 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:13:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:27,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065971244] [2020-01-16 18:13:27,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:27,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:27,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352071592] [2020-01-16 18:13:27,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:27,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:27,628 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:13:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:27,779 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:13:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:27,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:27,783 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:13:27,783 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:13:27,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:13:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 781. [2020-01-16 18:13:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:13:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:13:27,804 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:13:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:27,804 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:13:27,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:13:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:27,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:27,805 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:27,805 INFO L426 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1168558455, now seen corresponding path program 1012 times [2020-01-16 18:13:27,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:27,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732721495] [2020-01-16 18:13:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:28,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732721495] [2020-01-16 18:13:28,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:28,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:28,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936461761] [2020-01-16 18:13:28,245 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:28,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:28,246 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:13:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:28,432 INFO L93 Difference]: Finished difference Result 1205 states and 4250 transitions. [2020-01-16 18:13:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:28,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:28,436 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:13:28,436 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:13:28,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:13:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-01-16 18:13:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:13:28,457 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:13:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:28,458 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:13:28,458 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:13:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:28,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:28,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] [2020-01-16 18:13:28,459 INFO L426 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 643731839, now seen corresponding path program 1013 times [2020-01-16 18:13:28,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:28,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497080998] [2020-01-16 18:13:28,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:28,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497080998] [2020-01-16 18:13:28,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:28,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:28,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744674313] [2020-01-16 18:13:28,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:28,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:28,902 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:13:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:29,072 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-01-16 18:13:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:29,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:29,075 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:13:29,076 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:13:29,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:13:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 782. [2020-01-16 18:13:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:13:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3106 transitions. [2020-01-16 18:13:29,097 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3106 transitions. Word has length 25 [2020-01-16 18:13:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:29,097 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3106 transitions. [2020-01-16 18:13:29,097 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3106 transitions. [2020-01-16 18:13:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:29,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:29,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:29,098 INFO L426 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1181587417, now seen corresponding path program 1014 times [2020-01-16 18:13:29,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:29,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984294396] [2020-01-16 18:13:29,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:29,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984294396] [2020-01-16 18:13:29,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:29,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:29,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678366073] [2020-01-16 18:13:29,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:29,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:29,544 INFO L87 Difference]: Start difference. First operand 782 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:13:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:29,707 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-01-16 18:13:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:29,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:29,711 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:13:29,711 INFO L226 Difference]: Without dead ends: 1185 [2020-01-16 18:13:29,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-01-16 18:13:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 773. [2020-01-16 18:13:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:13:29,732 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:13:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:29,732 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:13:29,732 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:13:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:29,733 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:29,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:29,733 INFO L426 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2133658435, now seen corresponding path program 1015 times [2020-01-16 18:13:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:29,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958259155] [2020-01-16 18:13:29,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958259155] [2020-01-16 18:13:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:30,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457490346] [2020-01-16 18:13:30,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:30,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:30,158 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:13:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:30,340 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-01-16 18:13:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:30,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:30,344 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:13:30,344 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:13:30,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:13:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:13:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:13:30,366 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:13:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:30,366 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:13:30,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:13:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:30,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:30,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:30,367 INFO L426 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1191057247, now seen corresponding path program 1016 times [2020-01-16 18:13:30,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:30,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809544848] [2020-01-16 18:13:30,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:30,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809544848] [2020-01-16 18:13:30,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917863388] [2020-01-16 18:13:30,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:30,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:30,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:30,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:30,790 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:13:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:30,962 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-01-16 18:13:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:30,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:30,965 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:13:30,965 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:13:30,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:13:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:13:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:13:30,985 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:13:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:30,986 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:13:30,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:13:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:30,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:30,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:30,987 INFO L426 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:30,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1121073063, now seen corresponding path program 1017 times [2020-01-16 18:13:30,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:30,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484181427] [2020-01-16 18:13:30,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:31,431 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-01-16 18:13:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:31,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484181427] [2020-01-16 18:13:31,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:31,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:31,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320922383] [2020-01-16 18:13:31,437 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:31,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:31,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:31,438 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:13:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:31,594 INFO L93 Difference]: Finished difference Result 1189 states and 4211 transitions. [2020-01-16 18:13:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:31,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:31,598 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:13:31,598 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:31,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:13:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:13:31,619 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:13:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:31,619 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:13:31,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:13:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:31,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:31,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:31,620 INFO L426 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:31,621 INFO L82 PathProgramCache]: Analyzing trace with hash -98305929, now seen corresponding path program 1018 times [2020-01-16 18:13:31,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:31,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328184624] [2020-01-16 18:13:31,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:32,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-01-16 18:13:32,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328184624] [2020-01-16 18:13:32,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:32,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:32,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921307395] [2020-01-16 18:13:32,041 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:32,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:32,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:32,042 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:13:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:32,237 INFO L93 Difference]: Finished difference Result 1187 states and 4205 transitions. [2020-01-16 18:13:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:32,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:32,241 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:32,241 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:13:32,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:13:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:13:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:13:32,263 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:32,263 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:13:32,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:13:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:32,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:32,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] [2020-01-16 18:13:32,264 INFO L426 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 449952835, now seen corresponding path program 1019 times [2020-01-16 18:13:32,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:32,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992567310] [2020-01-16 18:13:32,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:32,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992567310] [2020-01-16 18:13:32,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:32,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:32,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770803659] [2020-01-16 18:13:32,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:32,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:32,682 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:32,841 INFO L93 Difference]: Finished difference Result 1193 states and 4217 transitions. [2020-01-16 18:13:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:32,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:32,845 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:32,845 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:13:32,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:13:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-01-16 18:13:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:13:32,866 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:32,866 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:13:32,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:13:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:32,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:32,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:32,867 INFO L426 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:32,867 INFO L82 PathProgramCache]: Analyzing trace with hash -85276967, now seen corresponding path program 1020 times [2020-01-16 18:13:32,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:32,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991352927] [2020-01-16 18:13:32,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:33,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-01-16 18:13:33,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991352927] [2020-01-16 18:13:33,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:33,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:33,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147819020] [2020-01-16 18:13:33,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:33,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:33,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:33,283 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:33,493 INFO L93 Difference]: Finished difference Result 1189 states and 4207 transitions. [2020-01-16 18:13:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:33,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:33,497 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:13:33,497 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:13:33,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:13:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-01-16 18:13:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:13:33,518 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:13:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:33,518 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:13:33,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:13:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:33,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:33,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] [2020-01-16 18:13:33,520 INFO L426 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1945631101, now seen corresponding path program 1021 times [2020-01-16 18:13:33,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:33,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138685276] [2020-01-16 18:13:33,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:33,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138685276] [2020-01-16 18:13:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:33,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:33,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129455749] [2020-01-16 18:13:33,955 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:33,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:33,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:33,955 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:13:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:34,133 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-01-16 18:13:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:34,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:34,136 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:34,136 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:13:34,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:13:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-01-16 18:13:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:13:34,157 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:13:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:34,157 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:13:34,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:13:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:34,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:34,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:34,159 INFO L426 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -943870175, now seen corresponding path program 1022 times [2020-01-16 18:13:34,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:34,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228449144] [2020-01-16 18:13:34,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:34,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228449144] [2020-01-16 18:13:34,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:34,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:34,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467722665] [2020-01-16 18:13:34,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:34,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:34,588 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:13:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:34,801 INFO L93 Difference]: Finished difference Result 1194 states and 4219 transitions. [2020-01-16 18:13:34,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:34,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:34,805 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:13:34,805 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:34,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-01-16 18:13:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:13:34,825 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:34,825 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:13:34,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:13:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:34,826 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:34,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:34,827 INFO L426 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1906437055, now seen corresponding path program 1023 times [2020-01-16 18:13:34,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:34,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632106441] [2020-01-16 18:13:34,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:35,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632106441] [2020-01-16 18:13:35,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:35,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:35,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266367046] [2020-01-16 18:13:35,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:35,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:35,259 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:35,431 INFO L93 Difference]: Finished difference Result 1188 states and 4207 transitions. [2020-01-16 18:13:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:35,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:35,435 INFO L225 Difference]: With dead ends: 1188 [2020-01-16 18:13:35,435 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:13:35,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:13:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:13:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:13:35,457 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:35,457 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:13:35,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:13:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:35,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:35,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:35,458 INFO L426 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1365763107, now seen corresponding path program 1024 times [2020-01-16 18:13:35,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:35,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664085372] [2020-01-16 18:13:35,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:35,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664085372] [2020-01-16 18:13:35,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:35,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020242661] [2020-01-16 18:13:35,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:35,886 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:36,081 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-01-16 18:13:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:36,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:36,085 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:13:36,085 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:13:36,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:13:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-01-16 18:13:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:13:36,106 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:13:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:36,106 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:13:36,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:13:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:36,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:36,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:36,107 INFO L426 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 697139907, now seen corresponding path program 1025 times [2020-01-16 18:13:36,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:36,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980242121] [2020-01-16 18:13:36,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:36,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980242121] [2020-01-16 18:13:36,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:36,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:36,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467928877] [2020-01-16 18:13:36,532 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:36,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:36,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:36,533 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:13:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:36,705 INFO L93 Difference]: Finished difference Result 1190 states and 4209 transitions. [2020-01-16 18:13:36,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:36,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:36,708 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:13:36,708 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:13:36,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:13:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:13:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:13:36,730 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:13:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:36,730 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:13:36,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:13:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:36,731 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:36,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:36,731 INFO L426 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -375945473, now seen corresponding path program 1026 times [2020-01-16 18:13:36,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:36,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277267463] [2020-01-16 18:13:36,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:37,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277267463] [2020-01-16 18:13:37,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:37,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:37,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487514229] [2020-01-16 18:13:37,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:37,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:37,157 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:13:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:37,360 INFO L93 Difference]: Finished difference Result 1187 states and 4201 transitions. [2020-01-16 18:13:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:37,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:37,364 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:37,364 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:13:37,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:13:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-01-16 18:13:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:13:37,388 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:13:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:37,388 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:13:37,388 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:13:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:37,389 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13: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] [2020-01-16 18:13:37,389 INFO L426 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash -24563171, now seen corresponding path program 1027 times [2020-01-16 18:13:37,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:37,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408604148] [2020-01-16 18:13:37,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:37,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408604148] [2020-01-16 18:13:37,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:37,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:37,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726090229] [2020-01-16 18:13:37,816 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:37,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:37,816 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:13:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:38,017 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-01-16 18:13:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:38,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:38,021 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:13:38,021 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:13:38,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:13:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-01-16 18:13:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-01-16 18:13:38,042 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-01-16 18:13:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:38,042 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-01-16 18:13:38,042 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-01-16 18:13:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:38,043 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:38,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] [2020-01-16 18:13:38,043 INFO L426 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 513292407, now seen corresponding path program 1028 times [2020-01-16 18:13:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:38,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834563345] [2020-01-16 18:13:38,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:38,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834563345] [2020-01-16 18:13:38,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:38,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:38,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583239766] [2020-01-16 18:13:38,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:38,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:38,465 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:13:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:38,629 INFO L93 Difference]: Finished difference Result 1200 states and 4230 transitions. [2020-01-16 18:13:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:38,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:38,633 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:13:38,633 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:13:38,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:13:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-01-16 18:13:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:13:38,654 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:13:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:38,654 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:13:38,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:13:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:38,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:38,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:38,655 INFO L426 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1069528417, now seen corresponding path program 1029 times [2020-01-16 18:13:38,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:38,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294812790] [2020-01-16 18:13:38,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:39,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294812790] [2020-01-16 18:13:39,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:39,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:39,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53967318] [2020-01-16 18:13:39,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:39,065 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:13:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:39,278 INFO L93 Difference]: Finished difference Result 1195 states and 4220 transitions. [2020-01-16 18:13:39,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:39,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:39,282 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:13:39,282 INFO L226 Difference]: Without dead ends: 1180 [2020-01-16 18:13:39,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-01-16 18:13:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-01-16 18:13:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:13:39,303 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:13:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:39,303 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:13:39,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:13:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:39,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:39,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:39,304 INFO L426 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 534298615, now seen corresponding path program 1030 times [2020-01-16 18:13:39,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:39,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801156886] [2020-01-16 18:13:39,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801156886] [2020-01-16 18:13:39,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:39,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188305778] [2020-01-16 18:13:39,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:39,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:39,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:39,723 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:13:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:39,925 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-01-16 18:13:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:39,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:39,929 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:13:39,929 INFO L226 Difference]: Without dead ends: 1178 [2020-01-16 18:13:39,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-01-16 18:13:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-01-16 18:13:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:13:39,950 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:13:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:39,951 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:13:39,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:13:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:39,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:39,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:39,952 INFO L426 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1101037729, now seen corresponding path program 1031 times [2020-01-16 18:13:39,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:39,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531432105] [2020-01-16 18:13:39,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:40,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-01-16 18:13:40,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531432105] [2020-01-16 18:13:40,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:40,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:40,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780473552] [2020-01-16 18:13:40,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:40,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:40,370 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:13:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:40,579 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-01-16 18:13:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:40,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:40,582 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:40,583 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:13:40,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:13:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-01-16 18:13:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:13:40,604 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:13:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:40,605 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:13:40,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:13:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:40,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:40,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] [2020-01-16 18:13:40,606 INFO L426 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:40,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash 27952349, now seen corresponding path program 1032 times [2020-01-16 18:13:40,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:40,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581464354] [2020-01-16 18:13:40,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:41,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581464354] [2020-01-16 18:13:41,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:41,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:41,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390328371] [2020-01-16 18:13:41,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:41,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:41,028 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:13:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:41,241 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-01-16 18:13:41,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:41,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:41,245 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:13:41,245 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:13:41,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:13:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2020-01-16 18:13:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:13:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:13:41,266 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:13:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:41,266 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:13:41,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:13:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:41,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:41,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:41,267 INFO L426 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash -24944675, now seen corresponding path program 1033 times [2020-01-16 18:13:41,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:41,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829145974] [2020-01-16 18:13:41,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:41,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829145974] [2020-01-16 18:13:41,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:41,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:41,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346382234] [2020-01-16 18:13:41,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:41,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:41,707 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:13:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:41,915 INFO L93 Difference]: Finished difference Result 1187 states and 4209 transitions. [2020-01-16 18:13:41,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:41,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:41,919 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:41,919 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:13:41,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:13:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-01-16 18:13:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-01-16 18:13:41,941 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-01-16 18:13:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:41,941 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-01-16 18:13:41,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-01-16 18:13:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:41,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:41,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:41,942 INFO L426 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 955810043, now seen corresponding path program 1034 times [2020-01-16 18:13:41,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:41,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632604903] [2020-01-16 18:13:41,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:42,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632604903] [2020-01-16 18:13:42,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:42,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:42,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261707020] [2020-01-16 18:13:42,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:42,387 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:13:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:42,595 INFO L93 Difference]: Finished difference Result 1186 states and 4204 transitions. [2020-01-16 18:13:42,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:42,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:42,599 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:13:42,599 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:13:42,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:13:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 776. [2020-01-16 18:13:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-01-16 18:13:42,619 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-01-16 18:13:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:42,620 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-01-16 18:13:42,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-01-16 18:13:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:42,621 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:42,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] [2020-01-16 18:13:42,621 INFO L426 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash -467843815, now seen corresponding path program 1035 times [2020-01-16 18:13:42,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:42,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62397299] [2020-01-16 18:13:42,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:43,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-01-16 18:13:43,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62397299] [2020-01-16 18:13:43,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:43,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:43,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496272357] [2020-01-16 18:13:43,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:43,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:43,064 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:13:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:43,267 INFO L93 Difference]: Finished difference Result 1190 states and 4213 transitions. [2020-01-16 18:13:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:43,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:43,271 INFO L225 Difference]: With dead ends: 1190 [2020-01-16 18:13:43,271 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:13:43,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:13:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 780. [2020-01-16 18:13:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:13:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-01-16 18:13:43,303 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-01-16 18:13:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:43,303 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-01-16 18:13:43,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-01-16 18:13:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:43,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:43,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:43,304 INFO L426 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:43,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 533917111, now seen corresponding path program 1036 times [2020-01-16 18:13:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:43,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525311355] [2020-01-16 18:13:43,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:43,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525311355] [2020-01-16 18:13:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:43,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251411166] [2020-01-16 18:13:43,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:43,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:43,751 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:13:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:43,908 INFO L93 Difference]: Finished difference Result 1191 states and 4211 transitions. [2020-01-16 18:13:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:43,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:43,912 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:13:43,912 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:13:43,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:13:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-01-16 18:13:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-01-16 18:13:43,934 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-01-16 18:13:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:43,934 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-01-16 18:13:43,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-01-16 18:13:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:43,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:43,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:43,935 INFO L426 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1945627677, now seen corresponding path program 1037 times [2020-01-16 18:13:43,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:43,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199322277] [2020-01-16 18:13:43,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:44,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199322277] [2020-01-16 18:13:44,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:44,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:44,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058210308] [2020-01-16 18:13:44,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:44,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:44,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:44,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:44,380 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:13:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:44,579 INFO L93 Difference]: Finished difference Result 1187 states and 4203 transitions. [2020-01-16 18:13:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:44,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:44,582 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:44,583 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:13:44,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:13:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-01-16 18:13:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:13:44,604 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:44,604 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:13:44,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:13:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:44,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:44,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] [2020-01-16 18:13:44,606 INFO L426 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash 872542297, now seen corresponding path program 1038 times [2020-01-16 18:13:44,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:44,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797419382] [2020-01-16 18:13:44,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797419382] [2020-01-16 18:13:45,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:45,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:45,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388079869] [2020-01-16 18:13:45,040 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:45,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:45,040 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:45,245 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-01-16 18:13:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:45,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:45,249 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:13:45,249 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:13:45,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:13:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 773. [2020-01-16 18:13:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:13:45,271 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:13:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:45,271 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:13:45,271 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:13:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:45,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:45,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:45,273 INFO L426 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -869916127, now seen corresponding path program 1039 times [2020-01-16 18:13:45,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:45,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328561768] [2020-01-16 18:13:45,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:45,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328561768] [2020-01-16 18:13:45,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:45,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:45,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247191109] [2020-01-16 18:13:45,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:45,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:45,724 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:13:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:45,932 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-01-16 18:13:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:45,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:45,935 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:13:45,935 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:13:45,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:13:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2020-01-16 18:13:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:13:45,956 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:45,956 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:13:45,956 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:13:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:45,957 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:45,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:45,957 INFO L426 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 110838591, now seen corresponding path program 1040 times [2020-01-16 18:13:45,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:45,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224711833] [2020-01-16 18:13:45,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:46,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-01-16 18:13:46,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224711833] [2020-01-16 18:13:46,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:46,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:46,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352248666] [2020-01-16 18:13:46,403 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:46,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:46,404 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:46,566 INFO L93 Difference]: Finished difference Result 1179 states and 4183 transitions. [2020-01-16 18:13:46,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:46,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:46,570 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:13:46,570 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:13:46,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:13:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-01-16 18:13:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:13:46,591 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:46,591 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:13:46,591 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:13:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:46,592 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:46,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:46,592 INFO L426 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1755714407, now seen corresponding path program 1041 times [2020-01-16 18:13:46,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:46,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683243620] [2020-01-16 18:13:46,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:47,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683243620] [2020-01-16 18:13:47,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:47,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:47,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471904252] [2020-01-16 18:13:47,031 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:47,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:47,031 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:47,237 INFO L93 Difference]: Finished difference Result 1178 states and 4181 transitions. [2020-01-16 18:13:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:47,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:47,241 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:13:47,241 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:13:47,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:13:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:13:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:13:47,261 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:47,261 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:13:47,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:13:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:47,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:47,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:47,263 INFO L426 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash -732947273, now seen corresponding path program 1042 times [2020-01-16 18:13:47,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:47,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461056947] [2020-01-16 18:13:47,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:47,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461056947] [2020-01-16 18:13:47,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:47,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:47,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092679693] [2020-01-16 18:13:47,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:47,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:47,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:47,714 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:47,861 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:13:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:47,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:47,864 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:13:47,865 INFO L226 Difference]: Without dead ends: 1163 [2020-01-16 18:13:47,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-01-16 18:13:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-01-16 18:13:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:13:47,886 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:13:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:47,886 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:13:47,886 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:13:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:47,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:47,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:47,887 INFO L426 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848673, now seen corresponding path program 1043 times [2020-01-16 18:13:47,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:47,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452303214] [2020-01-16 18:13:47,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:48,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-01-16 18:13:48,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452303214] [2020-01-16 18:13:48,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:48,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:48,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923019722] [2020-01-16 18:13:48,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:48,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:48,330 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:13:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:48,489 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-01-16 18:13:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:48,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:48,493 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:13:48,493 INFO L226 Difference]: Without dead ends: 1164 [2020-01-16 18:13:48,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-01-16 18:13:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 777. [2020-01-16 18:13:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:13:48,514 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:13:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:48,514 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:13:48,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:13:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:48,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:48,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:48,516 INFO L426 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash -394322087, now seen corresponding path program 1044 times [2020-01-16 18:13:48,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:48,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108675099] [2020-01-16 18:13:48,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:48,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108675099] [2020-01-16 18:13:48,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:48,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:48,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892383431] [2020-01-16 18:13:48,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:48,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:48,962 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:13:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:49,108 INFO L93 Difference]: Finished difference Result 1175 states and 4171 transitions. [2020-01-16 18:13:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:49,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:49,111 INFO L225 Difference]: With dead ends: 1175 [2020-01-16 18:13:49,112 INFO L226 Difference]: Without dead ends: 1160 [2020-01-16 18:13:49,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-01-16 18:13:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 773. [2020-01-16 18:13:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:13:49,132 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:13:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:49,132 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:13:49,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:13:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:49,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:49,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] [2020-01-16 18:13:49,133 INFO L426 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2137180577, now seen corresponding path program 1045 times [2020-01-16 18:13:49,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:49,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283142374] [2020-01-16 18:13:49,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:49,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283142374] [2020-01-16 18:13:49,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:49,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:49,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638655118] [2020-01-16 18:13:49,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:49,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:49,567 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:13:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:49,715 INFO L93 Difference]: Finished difference Result 1186 states and 4200 transitions. [2020-01-16 18:13:49,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:49,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:49,719 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:13:49,719 INFO L226 Difference]: Without dead ends: 1173 [2020-01-16 18:13:49,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-01-16 18:13:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 779. [2020-01-16 18:13:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:13:49,740 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:13:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:49,740 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:13:49,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:13:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:49,741 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:49,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:49,741 INFO L426 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025793, now seen corresponding path program 1046 times [2020-01-16 18:13:49,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:49,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977124727] [2020-01-16 18:13:49,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:50,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977124727] [2020-01-16 18:13:50,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:50,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:50,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961796265] [2020-01-16 18:13:50,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:50,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:50,178 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:13:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:50,323 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-01-16 18:13:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:50,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:50,326 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:13:50,326 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:13:50,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:13:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:13:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:13:50,346 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:13:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:50,346 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:13:50,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:13:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:50,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:50,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:50,347 INFO L426 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1694281437, now seen corresponding path program 1047 times [2020-01-16 18:13:50,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:50,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238020031] [2020-01-16 18:13:50,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238020031] [2020-01-16 18:13:50,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:50,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:50,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788436155] [2020-01-16 18:13:50,781 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:50,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:50,781 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:13:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:50,925 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:13:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:50,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:50,929 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:50,929 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:13:50,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:13:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:13:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:13:50,950 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:13:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:50,950 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:13:50,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:13:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:50,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:50,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:50,952 INFO L426 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1577918725, now seen corresponding path program 1048 times [2020-01-16 18:13:50,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:50,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067238579] [2020-01-16 18:13:50,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:51,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-01-16 18:13:51,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067238579] [2020-01-16 18:13:51,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:51,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:51,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103170948] [2020-01-16 18:13:51,398 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:51,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:51,398 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:13:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:51,570 INFO L93 Difference]: Finished difference Result 1179 states and 4180 transitions. [2020-01-16 18:13:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:51,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:51,574 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:13:51,574 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:13:51,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:13:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:13:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:13:51,595 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:13:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:51,595 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:13:51,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:13:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:51,596 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:51,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] [2020-01-16 18:13:51,596 INFO L426 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 484984289, now seen corresponding path program 1049 times [2020-01-16 18:13:51,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:51,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343807095] [2020-01-16 18:13:51,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:52,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343807095] [2020-01-16 18:13:52,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:52,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:52,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431130132] [2020-01-16 18:13:52,023 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:52,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:52,024 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:13:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:52,164 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:13:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:52,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:52,168 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:13:52,168 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:13:52,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:13:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:13:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:13:52,189 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:13:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:52,190 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:13:52,190 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:13:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:52,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:52,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:52,191 INFO L426 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash -588101091, now seen corresponding path program 1050 times [2020-01-16 18:13:52,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:52,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963460241] [2020-01-16 18:13:52,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:52,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963460241] [2020-01-16 18:13:52,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:52,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:52,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611764865] [2020-01-16 18:13:52,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:52,624 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:13:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:52,783 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:13:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:52,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:52,786 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:13:52,786 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:13:52,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:13:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:13:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:13:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:13:52,808 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:13:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:52,808 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:13:52,808 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:13:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:52,809 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:52,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:52,809 INFO L426 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1277332667, now seen corresponding path program 1051 times [2020-01-16 18:13:52,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:52,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050168441] [2020-01-16 18:13:52,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:53,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050168441] [2020-01-16 18:13:53,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:53,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:53,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029989206] [2020-01-16 18:13:53,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:53,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:53,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:53,240 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:13:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:53,385 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-01-16 18:13:53,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:53,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:53,389 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:53,389 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:13:53,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:13:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 778. [2020-01-16 18:13:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:13:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-01-16 18:13:53,411 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:53,411 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-01-16 18:13:53,411 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-01-16 18:13:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:53,412 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:53,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:53,412 INFO L426 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 204247287, now seen corresponding path program 1052 times [2020-01-16 18:13:53,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:53,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301161655] [2020-01-16 18:13:53,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:53,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301161655] [2020-01-16 18:13:53,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:53,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:53,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276729782] [2020-01-16 18:13:53,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:53,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:53,845 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:54,011 INFO L93 Difference]: Finished difference Result 1183 states and 4187 transitions. [2020-01-16 18:13:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:54,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:54,015 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:13:54,015 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:13:54,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:13:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:13:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:13:54,036 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:13:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:54,036 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:13:54,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:13:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:54,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:54,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] [2020-01-16 18:13:54,037 INFO L426 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1923543041, now seen corresponding path program 1053 times [2020-01-16 18:13:54,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:54,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165213826] [2020-01-16 18:13:54,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:54,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165213826] [2020-01-16 18:13:54,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:54,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:54,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320135527] [2020-01-16 18:13:54,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:54,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:54,474 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:13:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:54,616 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-01-16 18:13:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:54,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:54,619 INFO L225 Difference]: With dead ends: 1177 [2020-01-16 18:13:54,620 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:13:54,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:13:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-01-16 18:13:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:13:54,640 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:13:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:54,640 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:13:54,640 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:13:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:54,641 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:54,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:54,641 INFO L426 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 225253495, now seen corresponding path program 1054 times [2020-01-16 18:13:54,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:54,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043168917] [2020-01-16 18:13:54,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:55,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043168917] [2020-01-16 18:13:55,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:55,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:55,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131613514] [2020-01-16 18:13:55,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:55,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:55,079 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:13:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:55,245 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-01-16 18:13:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:55,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:55,249 INFO L225 Difference]: With dead ends: 1176 [2020-01-16 18:13:55,249 INFO L226 Difference]: Without dead ends: 1163 [2020-01-16 18:13:55,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-01-16 18:13:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-01-16 18:13:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:13:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:13:55,281 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:13:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:55,281 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:13:55,281 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:13:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:55,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:55,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:55,282 INFO L426 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1902536833, now seen corresponding path program 1055 times [2020-01-16 18:13:55,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:55,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986008063] [2020-01-16 18:13:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:55,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986008063] [2020-01-16 18:13:55,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:55,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:55,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700420668] [2020-01-16 18:13:55,716 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:55,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:55,716 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:13:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:55,865 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-01-16 18:13:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:55,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:55,869 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:13:55,869 INFO L226 Difference]: Without dead ends: 1167 [2020-01-16 18:13:55,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-01-16 18:13:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-01-16 18:13:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:13:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:13:55,889 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:13:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:55,890 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:13:55,890 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:13:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:55,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:55,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:55,891 INFO L426 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1319345083, now seen corresponding path program 1056 times [2020-01-16 18:13:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:55,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631411019] [2020-01-16 18:13:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:56,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-01-16 18:13:56,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631411019] [2020-01-16 18:13:56,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:56,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:56,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958372410] [2020-01-16 18:13:56,324 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:56,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:56,325 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:13:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:56,476 INFO L93 Difference]: Finished difference Result 1178 states and 4173 transitions. [2020-01-16 18:13:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:56,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:56,480 INFO L225 Difference]: With dead ends: 1178 [2020-01-16 18:13:56,480 INFO L226 Difference]: Without dead ends: 1161 [2020-01-16 18:13:56,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-01-16 18:13:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-01-16 18:13:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:13:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:13:56,501 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:13:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:56,501 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:13:56,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:13:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:56,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:56,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:56,503 INFO L426 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1231567229, now seen corresponding path program 1057 times [2020-01-16 18:13:56,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:56,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433909668] [2020-01-16 18:13:56,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:56,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433909668] [2020-01-16 18:13:56,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:56,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:56,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91235272] [2020-01-16 18:13:56,931 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:56,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:56,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:56,932 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:13:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:57,075 INFO L93 Difference]: Finished difference Result 1197 states and 4229 transitions. [2020-01-16 18:13:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:57,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:57,078 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:13:57,079 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:13:57,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:13:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-01-16 18:13:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:13:57,100 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:13:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:57,100 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:13:57,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:13:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:57,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:57,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:57,102 INFO L426 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 379373729, now seen corresponding path program 1058 times [2020-01-16 18:13:57,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:57,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432984840] [2020-01-16 18:13:57,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:57,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432984840] [2020-01-16 18:13:57,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:57,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:57,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356039602] [2020-01-16 18:13:57,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:57,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:57,532 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:13:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:57,675 INFO L93 Difference]: Finished difference Result 1194 states and 4220 transitions. [2020-01-16 18:13:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:57,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:57,677 INFO L225 Difference]: With dead ends: 1194 [2020-01-16 18:13:57,678 INFO L226 Difference]: Without dead ends: 1179 [2020-01-16 18:13:57,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-01-16 18:13:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-01-16 18:13:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-01-16 18:13:57,698 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-01-16 18:13:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:57,698 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-01-16 18:13:57,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-01-16 18:13:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:57,699 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:57,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:57,699 INFO L426 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash -137475641, now seen corresponding path program 1059 times [2020-01-16 18:13:57,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:57,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559541553] [2020-01-16 18:13:57,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:58,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559541553] [2020-01-16 18:13:58,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:58,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:58,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224752068] [2020-01-16 18:13:58,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:58,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:58,144 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:13:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:58,284 INFO L93 Difference]: Finished difference Result 1201 states and 4236 transitions. [2020-01-16 18:13:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:58,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:58,288 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:13:58,288 INFO L226 Difference]: Without dead ends: 1186 [2020-01-16 18:13:58,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-01-16 18:13:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 781. [2020-01-16 18:13:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:13:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3103 transitions. [2020-01-16 18:13:58,309 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3103 transitions. Word has length 25 [2020-01-16 18:13:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:58,309 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3103 transitions. [2020-01-16 18:13:58,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3103 transitions. [2020-01-16 18:13:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:58,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:58,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] [2020-01-16 18:13:58,311 INFO L426 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 400379937, now seen corresponding path program 1060 times [2020-01-16 18:13:58,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:58,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216495901] [2020-01-16 18:13:58,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:58,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216495901] [2020-01-16 18:13:58,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:58,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:58,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108266407] [2020-01-16 18:13:58,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:58,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:58,751 INFO L87 Difference]: Start difference. First operand 781 states and 3103 transitions. Second operand 10 states. [2020-01-16 18:13:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:58,893 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-01-16 18:13:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:58,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:58,897 INFO L225 Difference]: With dead ends: 1200 [2020-01-16 18:13:58,897 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:13:58,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:13:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-01-16 18:13:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-01-16 18:13:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-01-16 18:13:58,919 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-01-16 18:13:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:58,919 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-01-16 18:13:58,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-01-16 18:13:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:58,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:58,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:58,920 INFO L426 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -126972537, now seen corresponding path program 1061 times [2020-01-16 18:13:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:58,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740271338] [2020-01-16 18:13:58,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:59,355 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2020-01-16 18:13:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:59,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740271338] [2020-01-16 18:13:59,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:59,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:59,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485468790] [2020-01-16 18:13:59,360 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:59,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:59,361 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:13:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:13:59,512 INFO L93 Difference]: Finished difference Result 1193 states and 4215 transitions. [2020-01-16 18:13:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:13:59,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:13:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:13:59,516 INFO L225 Difference]: With dead ends: 1193 [2020-01-16 18:13:59,516 INFO L226 Difference]: Without dead ends: 1181 [2020-01-16 18:13:59,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:13:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-01-16 18:13:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-01-16 18:13:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:13:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:13:59,537 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:13:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:13:59,537 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:13:59,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:13:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:13:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:13:59,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:13:59,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:13:59,539 INFO L426 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:13:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:13:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1200057917, now seen corresponding path program 1062 times [2020-01-16 18:13:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:13:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779022323] [2020-01-16 18:13:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:13:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:13:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:13:59,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779022323] [2020-01-16 18:13:59,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:13:59,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:13:59,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503852566] [2020-01-16 18:13:59,961 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:13:59,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:13:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:13:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:13:59,962 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:14:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:00,103 INFO L93 Difference]: Finished difference Result 1195 states and 4216 transitions. [2020-01-16 18:14:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:00,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:00,107 INFO L225 Difference]: With dead ends: 1195 [2020-01-16 18:14:00,107 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:14:00,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:14:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-01-16 18:14:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:14:00,128 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:14:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:00,128 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:14:00,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:14:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:00,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:00,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:00,129 INFO L426 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1674466369, now seen corresponding path program 1063 times [2020-01-16 18:14:00,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:00,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446621868] [2020-01-16 18:14:00,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:00,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446621868] [2020-01-16 18:14:00,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:00,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:00,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17685677] [2020-01-16 18:14:00,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:00,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:00,569 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:14:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:00,706 INFO L93 Difference]: Finished difference Result 1189 states and 4205 transitions. [2020-01-16 18:14:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:00,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:00,709 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:14:00,709 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:14:00,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:14:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-01-16 18:14:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:14:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-01-16 18:14:00,730 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-01-16 18:14:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:00,731 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-01-16 18:14:00,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-01-16 18:14:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:00,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:00,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] [2020-01-16 18:14:00,732 INFO L426 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -63525411, now seen corresponding path program 1064 times [2020-01-16 18:14:00,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:00,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884274401] [2020-01-16 18:14:00,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:01,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884274401] [2020-01-16 18:14:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:01,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:01,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061400182] [2020-01-16 18:14:01,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:01,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:01,162 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:14:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:01,312 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-01-16 18:14:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:01,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:01,315 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:14:01,315 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:14:01,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:14:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-01-16 18:14:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:01,336 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:01,336 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:01,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:01,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:01,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] [2020-01-16 18:14:01,337 INFO L426 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 513716807, now seen corresponding path program 1065 times [2020-01-16 18:14:01,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:01,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514167321] [2020-01-16 18:14:01,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:01,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514167321] [2020-01-16 18:14:01,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:01,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:01,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942769701] [2020-01-16 18:14:01,758 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:01,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:01,758 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:01,900 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-01-16 18:14:01,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:01,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:01,904 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:14:01,904 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:14:01,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:14:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-01-16 18:14:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:01,925 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:01,925 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:01,925 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:01,926 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:01,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:01,926 INFO L426 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash -21512995, now seen corresponding path program 1066 times [2020-01-16 18:14:01,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:01,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969453397] [2020-01-16 18:14:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:02,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969453397] [2020-01-16 18:14:02,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:02,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:02,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801173481] [2020-01-16 18:14:02,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:02,345 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:02,514 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-01-16 18:14:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:02,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:02,518 INFO L225 Difference]: With dead ends: 1183 [2020-01-16 18:14:02,518 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:14:02,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:14:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-01-16 18:14:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:02,539 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:02,539 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:02,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:02,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:02,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:02,540 INFO L426 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 524219911, now seen corresponding path program 1067 times [2020-01-16 18:14:02,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:02,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402741715] [2020-01-16 18:14:02,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:02,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402741715] [2020-01-16 18:14:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:02,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622044305] [2020-01-16 18:14:02,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:02,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:02,983 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:03,128 INFO L93 Difference]: Finished difference Result 1181 states and 4184 transitions. [2020-01-16 18:14:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:03,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:03,132 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:14:03,132 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:14:03,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:14:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-01-16 18:14:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:03,153 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:03,153 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:03,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:03,154 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:03,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] [2020-01-16 18:14:03,154 INFO L426 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1621950849, now seen corresponding path program 1068 times [2020-01-16 18:14:03,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:03,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734205965] [2020-01-16 18:14:03,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:03,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-01-16 18:14:03,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734205965] [2020-01-16 18:14:03,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:03,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:03,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228370616] [2020-01-16 18:14:03,600 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:03,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:03,600 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:03,753 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:14:03,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:03,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:03,757 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:14:03,757 INFO L226 Difference]: Without dead ends: 1165 [2020-01-16 18:14:03,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-01-16 18:14:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-01-16 18:14:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:14:03,778 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:14:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:03,779 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:14:03,779 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:14:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:03,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:03,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] [2020-01-16 18:14:03,780 INFO L426 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1023273921, now seen corresponding path program 1069 times [2020-01-16 18:14:03,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:03,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484256491] [2020-01-16 18:14:03,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:04,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484256491] [2020-01-16 18:14:04,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:04,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:04,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605318167] [2020-01-16 18:14:04,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:04,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:04,212 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:14:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:04,356 INFO L93 Difference]: Finished difference Result 1197 states and 4223 transitions. [2020-01-16 18:14:04,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:04,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:04,360 INFO L225 Difference]: With dead ends: 1197 [2020-01-16 18:14:04,360 INFO L226 Difference]: Without dead ends: 1182 [2020-01-16 18:14:04,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-01-16 18:14:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 780. [2020-01-16 18:14:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:14:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-01-16 18:14:04,382 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-01-16 18:14:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:04,382 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-01-16 18:14:04,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-01-16 18:14:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:04,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:04,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:04,383 INFO L426 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -485418343, now seen corresponding path program 1070 times [2020-01-16 18:14:04,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:04,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225254525] [2020-01-16 18:14:04,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:04,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225254525] [2020-01-16 18:14:04,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:04,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:04,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513646366] [2020-01-16 18:14:04,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:04,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:04,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:04,822 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:14:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:04,971 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-01-16 18:14:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:04,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:04,974 INFO L225 Difference]: With dead ends: 1196 [2020-01-16 18:14:04,975 INFO L226 Difference]: Without dead ends: 1177 [2020-01-16 18:14:04,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-01-16 18:14:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-01-16 18:14:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:04,996 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:04,996 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:04,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:04,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:04,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:04,997 INFO L426 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 70817667, now seen corresponding path program 1071 times [2020-01-16 18:14:04,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:04,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058845314] [2020-01-16 18:14:04,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:05,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058845314] [2020-01-16 18:14:05,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:05,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:05,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044540156] [2020-01-16 18:14:05,425 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:05,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:05,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:05,426 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:05,573 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-01-16 18:14:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:05,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:05,577 INFO L225 Difference]: With dead ends: 1191 [2020-01-16 18:14:05,577 INFO L226 Difference]: Without dead ends: 1176 [2020-01-16 18:14:05,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-01-16 18:14:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-01-16 18:14:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:05,598 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:05,598 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:05,598 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:05,599 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:05,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:05,600 INFO L426 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash -464412135, now seen corresponding path program 1072 times [2020-01-16 18:14:05,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:05,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390860780] [2020-01-16 18:14:05,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:06,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390860780] [2020-01-16 18:14:06,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:06,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:06,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295682958] [2020-01-16 18:14:06,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:06,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:06,025 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:06,199 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-01-16 18:14:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:06,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:06,203 INFO L225 Difference]: With dead ends: 1187 [2020-01-16 18:14:06,203 INFO L226 Difference]: Without dead ends: 1174 [2020-01-16 18:14:06,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-01-16 18:14:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-01-16 18:14:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:14:06,224 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:14:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:06,225 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:14:06,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:14:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:06,226 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:06,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:06,226 INFO L426 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash 102326979, now seen corresponding path program 1073 times [2020-01-16 18:14:06,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:06,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350685269] [2020-01-16 18:14:06,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:06,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350685269] [2020-01-16 18:14:06,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:06,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:06,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549850664] [2020-01-16 18:14:06,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:06,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:06,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:06,647 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:14:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:06,795 INFO L93 Difference]: Finished difference Result 1189 states and 4200 transitions. [2020-01-16 18:14:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:06,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:06,798 INFO L225 Difference]: With dead ends: 1189 [2020-01-16 18:14:06,799 INFO L226 Difference]: Without dead ends: 1175 [2020-01-16 18:14:06,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-01-16 18:14:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-01-16 18:14:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:14:06,819 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:14:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:06,819 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:14:06,820 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:14:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:06,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:06,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:06,821 INFO L426 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -970758401, now seen corresponding path program 1074 times [2020-01-16 18:14:06,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:06,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839839311] [2020-01-16 18:14:06,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:07,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839839311] [2020-01-16 18:14:07,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:07,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:07,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887193816] [2020-01-16 18:14:07,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:07,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:07,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:07,253 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:14:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:07,428 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-01-16 18:14:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:07,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:07,432 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:14:07,432 INFO L226 Difference]: Without dead ends: 1171 [2020-01-16 18:14:07,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-01-16 18:14:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-01-16 18:14:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:14:07,468 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:14:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:07,468 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:14:07,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:14:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:07,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:07,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:07,469 INFO L426 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 913263261, now seen corresponding path program 1075 times [2020-01-16 18:14:07,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:07,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029769003] [2020-01-16 18:14:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:07,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029769003] [2020-01-16 18:14:07,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:07,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:07,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627189599] [2020-01-16 18:14:07,903 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:07,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:07,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:07,903 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:14:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:08,051 INFO L93 Difference]: Finished difference Result 1184 states and 4191 transitions. [2020-01-16 18:14:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:08,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:08,055 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:14:08,055 INFO L226 Difference]: Without dead ends: 1172 [2020-01-16 18:14:08,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-01-16 18:14:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-01-16 18:14:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:14:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-01-16 18:14:08,077 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:08,077 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-01-16 18:14:08,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-01-16 18:14:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:08,078 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:08,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:08,078 INFO L426 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -159822119, now seen corresponding path program 1076 times [2020-01-16 18:14:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:08,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814892668] [2020-01-16 18:14:08,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:08,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814892668] [2020-01-16 18:14:08,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:08,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:08,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173588369] [2020-01-16 18:14:08,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:08,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:08,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:08,509 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:08,656 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-01-16 18:14:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:08,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:08,660 INFO L225 Difference]: With dead ends: 1186 [2020-01-16 18:14:08,660 INFO L226 Difference]: Without dead ends: 1169 [2020-01-16 18:14:08,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-01-16 18:14:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-01-16 18:14:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:14:08,682 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:14:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:08,682 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:14:08,682 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:14:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:08,683 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:08,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] [2020-01-16 18:14:08,683 INFO L426 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2007354849, now seen corresponding path program 1077 times [2020-01-16 18:14:08,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:08,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358053697] [2020-01-16 18:14:08,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:09,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358053697] [2020-01-16 18:14:09,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:09,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:09,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896977640] [2020-01-16 18:14:09,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:09,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:09,119 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:14:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:09,266 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-01-16 18:14:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:09,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:09,270 INFO L225 Difference]: With dead ends: 1180 [2020-01-16 18:14:09,270 INFO L226 Difference]: Without dead ends: 1168 [2020-01-16 18:14:09,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-01-16 18:14:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-01-16 18:14:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:14:09,291 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:14:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:09,291 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:14:09,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:14:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:09,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:09,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:09,292 INFO L426 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -138815911, now seen corresponding path program 1078 times [2020-01-16 18:14:09,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:09,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283616065] [2020-01-16 18:14:09,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283616065] [2020-01-16 18:14:09,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:09,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:09,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504312662] [2020-01-16 18:14:09,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:09,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:09,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:09,727 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:14:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:09,898 INFO L93 Difference]: Finished difference Result 1179 states and 4176 transitions. [2020-01-16 18:14:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:09,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:09,901 INFO L225 Difference]: With dead ends: 1179 [2020-01-16 18:14:09,902 INFO L226 Difference]: Without dead ends: 1166 [2020-01-16 18:14:09,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-01-16 18:14:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-01-16 18:14:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:14:09,922 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:14:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:09,922 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:14:09,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:14:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:09,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:09,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:09,924 INFO L426 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2028361057, now seen corresponding path program 1079 times [2020-01-16 18:14:09,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:09,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102710393] [2020-01-16 18:14:09,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:10,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102710393] [2020-01-16 18:14:10,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:10,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:10,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118149247] [2020-01-16 18:14:10,358 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:10,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:10,358 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:14:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:10,510 INFO L93 Difference]: Finished difference Result 1184 states and 4186 transitions. [2020-01-16 18:14:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:10,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:10,514 INFO L225 Difference]: With dead ends: 1184 [2020-01-16 18:14:10,514 INFO L226 Difference]: Without dead ends: 1170 [2020-01-16 18:14:10,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-01-16 18:14:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-01-16 18:14:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:14:10,537 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:14:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:10,538 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:14:10,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:14:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:10,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:10,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:10,539 INFO L426 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash 955275677, now seen corresponding path program 1080 times [2020-01-16 18:14:10,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:10,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810550979] [2020-01-16 18:14:10,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:10,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810550979] [2020-01-16 18:14:10,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:10,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:10,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980150459] [2020-01-16 18:14:10,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:10,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:10,982 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:14:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:11,151 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-01-16 18:14:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:11,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:11,155 INFO L225 Difference]: With dead ends: 1181 [2020-01-16 18:14:11,155 INFO L226 Difference]: Without dead ends: 1162 [2020-01-16 18:14:11,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-01-16 18:14:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 769. [2020-01-16 18:14:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-01-16 18:14:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3072 transitions. [2020-01-16 18:14:11,176 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3072 transitions. Word has length 25 [2020-01-16 18:14:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:11,176 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 3072 transitions. [2020-01-16 18:14:11,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3072 transitions. [2020-01-16 18:14:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:11,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:11,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:11,177 INFO L426 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1755725605, now seen corresponding path program 1081 times [2020-01-16 18:14:11,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:11,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904638567] [2020-01-16 18:14:11,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:11,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904638567] [2020-01-16 18:14:11,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:11,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:11,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10623794] [2020-01-16 18:14:11,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:11,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:11,592 INFO L87 Difference]: Start difference. First operand 769 states and 3072 transitions. Second operand 10 states. [2020-01-16 18:14:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:11,749 INFO L93 Difference]: Finished difference Result 1246 states and 4389 transitions. [2020-01-16 18:14:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:11,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:11,753 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:14:11,753 INFO L226 Difference]: Without dead ends: 1233 [2020-01-16 18:14:11,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-01-16 18:14:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 783. [2020-01-16 18:14:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-01-16 18:14:11,775 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-01-16 18:14:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:11,775 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-01-16 18:14:11,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-01-16 18:14:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:11,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:11,776 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:11,776 INFO L426 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1568990077, now seen corresponding path program 1082 times [2020-01-16 18:14:11,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:11,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078423079] [2020-01-16 18:14:11,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078423079] [2020-01-16 18:14:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:12,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:12,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277496940] [2020-01-16 18:14:12,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:12,195 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-01-16 18:14:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:12,346 INFO L93 Difference]: Finished difference Result 1248 states and 4389 transitions. [2020-01-16 18:14:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:12,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:12,350 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:14:12,350 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:14:12,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:14:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 779. [2020-01-16 18:14:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-01-16 18:14:12,372 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-01-16 18:14:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:12,372 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-01-16 18:14:12,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-01-16 18:14:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:12,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:12,373 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:12,373 INFO L426 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1312826465, now seen corresponding path program 1083 times [2020-01-16 18:14:12,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:12,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062798080] [2020-01-16 18:14:12,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:12,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062798080] [2020-01-16 18:14:12,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:12,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:12,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243261638] [2020-01-16 18:14:12,791 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:12,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:12,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:12,792 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:14:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:12,941 INFO L93 Difference]: Finished difference Result 1247 states and 4387 transitions. [2020-01-16 18:14:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:12,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:12,945 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:14:12,945 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:14:12,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:14:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-01-16 18:14:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-01-16 18:14:12,966 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-01-16 18:14:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:12,967 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-01-16 18:14:12,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-01-16 18:14:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:12,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:12,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:12,968 INFO L426 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1990883009, now seen corresponding path program 1084 times [2020-01-16 18:14:12,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:12,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13051448] [2020-01-16 18:14:12,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:13,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13051448] [2020-01-16 18:14:13,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:13,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:13,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813358874] [2020-01-16 18:14:13,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:13,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:13,388 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:14:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:13,578 INFO L93 Difference]: Finished difference Result 1250 states and 4389 transitions. [2020-01-16 18:14:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:13,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:13,581 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:14:13,581 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:14:13,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:14:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-01-16 18:14:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-01-16 18:14:13,603 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-01-16 18:14:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:13,603 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-01-16 18:14:13,603 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-01-16 18:14:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:13,604 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:13,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:13,604 INFO L426 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash -904768667, now seen corresponding path program 1085 times [2020-01-16 18:14:13,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791725591] [2020-01-16 18:14:13,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:14,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791725591] [2020-01-16 18:14:14,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:14,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:14,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782989033] [2020-01-16 18:14:14,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:14,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:14,028 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:14:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:14,175 INFO L93 Difference]: Finished difference Result 1253 states and 4397 transitions. [2020-01-16 18:14:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:14,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:14,179 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:14:14,179 INFO L226 Difference]: Without dead ends: 1238 [2020-01-16 18:14:14,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-01-16 18:14:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 785. [2020-01-16 18:14:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:14:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-01-16 18:14:14,201 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-01-16 18:14:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:14,201 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-01-16 18:14:14,201 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-01-16 18:14:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:14,202 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:14,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:14,202 INFO L426 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1977854047, now seen corresponding path program 1086 times [2020-01-16 18:14:14,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:14,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029343753] [2020-01-16 18:14:14,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:14,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029343753] [2020-01-16 18:14:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:14,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:14,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477726811] [2020-01-16 18:14:14,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:14,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:14,629 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:14:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:14,781 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-01-16 18:14:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:14,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:14,785 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:14:14,785 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:14:14,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:14:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 775. [2020-01-16 18:14:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3098 transitions. [2020-01-16 18:14:14,807 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3098 transitions. Word has length 25 [2020-01-16 18:14:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:14,807 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3098 transitions. [2020-01-16 18:14:14,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3098 transitions. [2020-01-16 18:14:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:14,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:14,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:14,808 INFO L426 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1333239879, now seen corresponding path program 1087 times [2020-01-16 18:14:14,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:14,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588886186] [2020-01-16 18:14:14,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14: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-01-16 18:14:15,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588886186] [2020-01-16 18:14:15,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:15,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:15,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346069547] [2020-01-16 18:14:15,236 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:15,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:15,237 INFO L87 Difference]: Start difference. First operand 775 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:14:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:15,387 INFO L93 Difference]: Finished difference Result 1243 states and 4378 transitions. [2020-01-16 18:14:15,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:15,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:15,391 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:14:15,391 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:14:15,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:14:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:14:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-01-16 18:14:15,412 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-01-16 18:14:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:15,413 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-01-16 18:14:15,413 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-01-16 18:14:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:15,414 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:15,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:15,414 INFO L426 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1991475803, now seen corresponding path program 1088 times [2020-01-16 18:14:15,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:15,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008955131] [2020-01-16 18:14:15,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:15,848 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2020-01-16 18:14:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:15,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008955131] [2020-01-16 18:14:15,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:15,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:15,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430347692] [2020-01-16 18:14:15,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:15,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:15,854 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:14:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:16,003 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-01-16 18:14:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:16,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:16,007 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:14:16,007 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:14:16,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:14:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:14:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-01-16 18:14:16,028 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-01-16 18:14:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:16,028 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-01-16 18:14:16,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-01-16 18:14:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:16,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:16,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:16,029 INFO L426 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1478592479, now seen corresponding path program 1089 times [2020-01-16 18:14:16,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:16,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438054498] [2020-01-16 18:14:16,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:16,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-01-16 18:14:16,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438054498] [2020-01-16 18:14:16,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:16,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:16,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493426327] [2020-01-16 18:14:16,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:16,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:16,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:16,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:16,463 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-01-16 18:14:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:16,608 INFO L93 Difference]: Finished difference Result 1242 states and 4372 transitions. [2020-01-16 18:14:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:16,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:16,611 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:14:16,611 INFO L226 Difference]: Without dead ends: 1229 [2020-01-16 18:14:16,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-01-16 18:14:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-01-16 18:14:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:14:16,634 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:14:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:16,634 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:14:16,634 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:14:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:16,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:16,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] [2020-01-16 18:14:16,635 INFO L426 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -476831553, now seen corresponding path program 1090 times [2020-01-16 18:14:16,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:16,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618274739] [2020-01-16 18:14:16,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:17,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618274739] [2020-01-16 18:14:17,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:17,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:17,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573877011] [2020-01-16 18:14:17,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:17,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:17,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:17,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:17,055 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:14:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:17,223 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-01-16 18:14:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:17,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:17,226 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:14:17,227 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:14:17,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:14:17,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 779. [2020-01-16 18:14:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:14:17,248 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:14:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:17,248 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:14:17,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:14:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:17,249 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:17,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:17,249 INFO L426 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1001658169, now seen corresponding path program 1091 times [2020-01-16 18:14:17,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:17,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214168791] [2020-01-16 18:14:17,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:17,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214168791] [2020-01-16 18:14:17,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:17,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:17,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901199902] [2020-01-16 18:14:17,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:17,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:17,673 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:14:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:17,823 INFO L93 Difference]: Finished difference Result 1247 states and 4379 transitions. [2020-01-16 18:14:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:17,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:17,827 INFO L225 Difference]: With dead ends: 1247 [2020-01-16 18:14:17,827 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:14:17,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:14:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 784. [2020-01-16 18:14:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:14:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-01-16 18:14:17,848 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-01-16 18:14:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:17,848 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-01-16 18:14:17,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-01-16 18:14:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:17,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:17,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:17,850 INFO L426 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -463802591, now seen corresponding path program 1092 times [2020-01-16 18:14:17,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:17,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269743273] [2020-01-16 18:14:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:18,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269743273] [2020-01-16 18:14:18,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:18,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:18,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584207880] [2020-01-16 18:14:18,282 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:18,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:18,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:18,282 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:14:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:18,427 INFO L93 Difference]: Finished difference Result 1246 states and 4372 transitions. [2020-01-16 18:14:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:18,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:18,431 INFO L225 Difference]: With dead ends: 1246 [2020-01-16 18:14:18,431 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:14:18,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:14:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 775. [2020-01-16 18:14:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-01-16 18:14:18,452 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-01-16 18:14:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:18,452 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-01-16 18:14:18,452 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-01-16 18:14:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:18,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:18,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:18,453 INFO L426 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 45369287, now seen corresponding path program 1093 times [2020-01-16 18:14:18,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:18,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362864135] [2020-01-16 18:14:18,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:18,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362864135] [2020-01-16 18:14:18,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:18,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:18,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981350837] [2020-01-16 18:14:18,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:18,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:18,870 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:14:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:19,031 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-01-16 18:14:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:19,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:19,035 INFO L225 Difference]: With dead ends: 1245 [2020-01-16 18:14:19,036 INFO L226 Difference]: Without dead ends: 1232 [2020-01-16 18:14:19,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-01-16 18:14:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-01-16 18:14:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-01-16 18:14:19,059 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-01-16 18:14:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:19,059 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-01-16 18:14:19,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-01-16 18:14:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:19,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:19,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] [2020-01-16 18:14:19,060 INFO L426 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1036627109, now seen corresponding path program 1094 times [2020-01-16 18:14:19,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:19,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353379090] [2020-01-16 18:14:19,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:19,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353379090] [2020-01-16 18:14:19,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:19,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:19,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252763561] [2020-01-16 18:14:19,479 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:19,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:19,479 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-01-16 18:14:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:19,625 INFO L93 Difference]: Finished difference Result 1248 states and 4380 transitions. [2020-01-16 18:14:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:19,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:19,628 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:14:19,628 INFO L226 Difference]: Without dead ends: 1228 [2020-01-16 18:14:19,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-01-16 18:14:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-01-16 18:14:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-01-16 18:14:19,649 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-01-16 18:14:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:19,649 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-01-16 18:14:19,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-01-16 18:14:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:19,650 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:19,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:19,650 INFO L426 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1971403365, now seen corresponding path program 1095 times [2020-01-16 18:14:19,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:19,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739571127] [2020-01-16 18:14:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:20,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739571127] [2020-01-16 18:14:20,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:20,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:20,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492856206] [2020-01-16 18:14:20,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:20,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:20,082 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-01-16 18:14:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:20,227 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-01-16 18:14:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:20,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:20,230 INFO L225 Difference]: With dead ends: 1243 [2020-01-16 18:14:20,230 INFO L226 Difference]: Without dead ends: 1230 [2020-01-16 18:14:20,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-01-16 18:14:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-01-16 18:14:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-01-16 18:14:20,251 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-01-16 18:14:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:20,251 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-01-16 18:14:20,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-01-16 18:14:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:20,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:20,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:20,253 INFO L426 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1321803005, now seen corresponding path program 1096 times [2020-01-16 18:14:20,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:20,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996553080] [2020-01-16 18:14:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:20,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996553080] [2020-01-16 18:14:20,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:20,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:20,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463900473] [2020-01-16 18:14:20,674 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:20,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:20,675 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:14:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:20,825 INFO L93 Difference]: Finished difference Result 1244 states and 4368 transitions. [2020-01-16 18:14:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:20,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:20,829 INFO L225 Difference]: With dead ends: 1244 [2020-01-16 18:14:20,829 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:14:20,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:14:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-01-16 18:14:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-01-16 18:14:20,850 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-01-16 18:14:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:20,851 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-01-16 18:14:20,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-01-16 18:14:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:20,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:20,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:20,852 INFO L426 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2026444743, now seen corresponding path program 1097 times [2020-01-16 18:14:20,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:20,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400863918] [2020-01-16 18:14:20,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:21,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400863918] [2020-01-16 18:14:21,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:21,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:21,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476932928] [2020-01-16 18:14:21,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:21,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:21,276 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:14:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:21,418 INFO L93 Difference]: Finished difference Result 1250 states and 4381 transitions. [2020-01-16 18:14:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:21,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:21,422 INFO L225 Difference]: With dead ends: 1250 [2020-01-16 18:14:21,422 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:14:21,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:14:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2020-01-16 18:14:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:14:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-01-16 18:14:21,444 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-01-16 18:14:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:21,444 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-01-16 18:14:21,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-01-16 18:14:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:21,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:21,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:21,446 INFO L426 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -657581595, now seen corresponding path program 1098 times [2020-01-16 18:14:21,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:21,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975698208] [2020-01-16 18:14:21,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:21,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975698208] [2020-01-16 18:14:21,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:21,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:21,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446833617] [2020-01-16 18:14:21,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:21,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:21,865 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:14:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:22,022 INFO L93 Difference]: Finished difference Result 1248 states and 4372 transitions. [2020-01-16 18:14:22,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:22,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:22,025 INFO L225 Difference]: With dead ends: 1248 [2020-01-16 18:14:22,025 INFO L226 Difference]: Without dead ends: 1225 [2020-01-16 18:14:22,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-01-16 18:14:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-01-16 18:14:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3090 transitions. [2020-01-16 18:14:22,046 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:22,046 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3090 transitions. [2020-01-16 18:14:22,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3090 transitions. [2020-01-16 18:14:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:22,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:22,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:22,047 INFO L426 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -285193085, now seen corresponding path program 1099 times [2020-01-16 18:14:22,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:22,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337869196] [2020-01-16 18:14:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:22,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337869196] [2020-01-16 18:14:22,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:22,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:22,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48475169] [2020-01-16 18:14:22,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:22,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:22,487 INFO L87 Difference]: Start difference. First operand 775 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:22,643 INFO L93 Difference]: Finished difference Result 1257 states and 4405 transitions. [2020-01-16 18:14:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:22,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:22,647 INFO L225 Difference]: With dead ends: 1257 [2020-01-16 18:14:22,647 INFO L226 Difference]: Without dead ends: 1242 [2020-01-16 18:14:22,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-01-16 18:14:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 786. [2020-01-16 18:14:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-01-16 18:14:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-01-16 18:14:22,669 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-01-16 18:14:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:22,669 INFO L478 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-01-16 18:14:22,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-01-16 18:14:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:22,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:22,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:22,670 INFO L426 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278465, now seen corresponding path program 1100 times [2020-01-16 18:14:22,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:22,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455294950] [2020-01-16 18:14:22,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:23,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455294950] [2020-01-16 18:14:23,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:23,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:23,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768614659] [2020-01-16 18:14:23,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:23,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:23,102 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-01-16 18:14:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:23,243 INFO L93 Difference]: Finished difference Result 1258 states and 4401 transitions. [2020-01-16 18:14:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:23,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:23,247 INFO L225 Difference]: With dead ends: 1258 [2020-01-16 18:14:23,247 INFO L226 Difference]: Without dead ends: 1236 [2020-01-16 18:14:23,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-01-16 18:14:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 780. [2020-01-16 18:14:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:14:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3104 transitions. [2020-01-16 18:14:23,269 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3104 transitions. Word has length 25 [2020-01-16 18:14:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:23,269 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3104 transitions. [2020-01-16 18:14:23,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3104 transitions. [2020-01-16 18:14:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:23,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:23,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:23,270 INFO L426 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630939, now seen corresponding path program 1101 times [2020-01-16 18:14:23,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:23,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523221491] [2020-01-16 18:14:23,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:23,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523221491] [2020-01-16 18:14:23,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:23,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:23,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912337987] [2020-01-16 18:14:23,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:23,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:23,705 INFO L87 Difference]: Start difference. First operand 780 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:14:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:23,848 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-01-16 18:14:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:23,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:23,852 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:14:23,852 INFO L226 Difference]: Without dead ends: 1239 [2020-01-16 18:14:23,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-01-16 18:14:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 785. [2020-01-16 18:14:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:14:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3113 transitions. [2020-01-16 18:14:23,873 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3113 transitions. Word has length 25 [2020-01-16 18:14:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:23,873 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3113 transitions. [2020-01-16 18:14:23,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3113 transitions. [2020-01-16 18:14:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:23,874 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:23,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:23,875 INFO L426 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1347775361, now seen corresponding path program 1102 times [2020-01-16 18:14:23,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:23,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893497709] [2020-01-16 18:14:23,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:24,306 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-01-16 18:14:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:24,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893497709] [2020-01-16 18:14:24,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:24,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:24,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810089739] [2020-01-16 18:14:24,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:24,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:24,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:24,312 INFO L87 Difference]: Start difference. First operand 785 states and 3113 transitions. Second operand 10 states. [2020-01-16 18:14:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:24,461 INFO L93 Difference]: Finished difference Result 1253 states and 4386 transitions. [2020-01-16 18:14:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:24,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:24,464 INFO L225 Difference]: With dead ends: 1253 [2020-01-16 18:14:24,465 INFO L226 Difference]: Without dead ends: 1234 [2020-01-16 18:14:24,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-01-16 18:14:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 780. [2020-01-16 18:14:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:14:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-01-16 18:14:24,485 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-01-16 18:14:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:24,486 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-01-16 18:14:24,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-01-16 18:14:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:24,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:24,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] [2020-01-16 18:14:24,487 INFO L426 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1864624731, now seen corresponding path program 1103 times [2020-01-16 18:14:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079364411] [2020-01-16 18:14:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:24,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-01-16 18:14:24,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079364411] [2020-01-16 18:14:24,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:24,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:24,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302815411] [2020-01-16 18:14:24,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:24,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:24,914 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:14:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:25,056 INFO L93 Difference]: Finished difference Result 1256 states and 4392 transitions. [2020-01-16 18:14:25,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:25,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:25,060 INFO L225 Difference]: With dead ends: 1256 [2020-01-16 18:14:25,060 INFO L226 Difference]: Without dead ends: 1240 [2020-01-16 18:14:25,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-01-16 18:14:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 785. [2020-01-16 18:14:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-01-16 18:14:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3108 transitions. [2020-01-16 18:14:25,081 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3108 transitions. Word has length 25 [2020-01-16 18:14:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:25,082 INFO L478 AbstractCegarLoop]: Abstraction has 785 states and 3108 transitions. [2020-01-16 18:14:25,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3108 transitions. [2020-01-16 18:14:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:25,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:25,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] [2020-01-16 18:14:25,083 INFO L426 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:25,083 INFO L82 PathProgramCache]: Analyzing trace with hash -253683773, now seen corresponding path program 1104 times [2020-01-16 18:14:25,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:25,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474459142] [2020-01-16 18:14:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:25,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-01-16 18:14:25,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474459142] [2020-01-16 18:14:25,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:25,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:25,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084460266] [2020-01-16 18:14:25,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:25,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:25,516 INFO L87 Difference]: Start difference. First operand 785 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:14:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:25,670 INFO L93 Difference]: Finished difference Result 1254 states and 4383 transitions. [2020-01-16 18:14:25,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:25,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:25,674 INFO L225 Difference]: With dead ends: 1254 [2020-01-16 18:14:25,674 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:14:25,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:14:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 771. [2020-01-16 18:14:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:14:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-01-16 18:14:25,696 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-01-16 18:14:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:25,696 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-01-16 18:14:25,696 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-01-16 18:14:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:25,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:25,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:25,697 INFO L426 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1331414369, now seen corresponding path program 1105 times [2020-01-16 18:14:25,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:25,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978089828] [2020-01-16 18:14:25,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:26,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978089828] [2020-01-16 18:14:26,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:26,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:26,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986391065] [2020-01-16 18:14:26,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:26,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:26,082 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-01-16 18:14:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:26,235 INFO L93 Difference]: Finished difference Result 1226 states and 4319 transitions. [2020-01-16 18:14:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:26,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:26,238 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:14:26,239 INFO L226 Difference]: Without dead ends: 1213 [2020-01-16 18:14:26,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-01-16 18:14:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 781. [2020-01-16 18:14:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-01-16 18:14:26,261 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-01-16 18:14:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:26,261 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-01-16 18:14:26,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-01-16 18:14:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:26,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:26,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:26,262 INFO L426 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1993301313, now seen corresponding path program 1106 times [2020-01-16 18:14:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:26,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100607849] [2020-01-16 18:14:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:26,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100607849] [2020-01-16 18:14:26,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:26,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:26,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933243257] [2020-01-16 18:14:26,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:26,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:26,652 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-01-16 18:14:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:26,804 INFO L93 Difference]: Finished difference Result 1228 states and 4319 transitions. [2020-01-16 18:14:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:26,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:26,808 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:14:26,808 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:14:26,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:14:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 777. [2020-01-16 18:14:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-01-16 18:14:26,829 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-01-16 18:14:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:26,829 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-01-16 18:14:26,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-01-16 18:14:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:26,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:26,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:26,830 INFO L426 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash 888515229, now seen corresponding path program 1107 times [2020-01-16 18:14:26,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:26,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653872620] [2020-01-16 18:14:26,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:27,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653872620] [2020-01-16 18:14:27,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:27,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:27,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640914376] [2020-01-16 18:14:27,228 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:27,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:27,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:27,228 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-01-16 18:14:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:27,401 INFO L93 Difference]: Finished difference Result 1227 states and 4317 transitions. [2020-01-16 18:14:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:27,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:27,405 INFO L225 Difference]: With dead ends: 1227 [2020-01-16 18:14:27,405 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:14:27,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:14:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-01-16 18:14:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:14:27,428 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:14:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:27,428 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:14:27,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:14:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:27,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:27,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:27,429 INFO L426 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1879773051, now seen corresponding path program 1108 times [2020-01-16 18:14:27,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:27,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074621409] [2020-01-16 18:14:27,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:27,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-01-16 18:14:27,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074621409] [2020-01-16 18:14:27,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:27,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:27,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230007910] [2020-01-16 18:14:27,831 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:27,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:27,832 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:14:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:27,999 INFO L93 Difference]: Finished difference Result 1230 states and 4319 transitions. [2020-01-16 18:14:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:28,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:28,003 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:14:28,003 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:14:28,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:14:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 777. [2020-01-16 18:14:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:14:28,025 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:14:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:28,025 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:14:28,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:14:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:28,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:28,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] [2020-01-16 18:14:28,026 INFO L426 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1329079903, now seen corresponding path program 1109 times [2020-01-16 18:14:28,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:28,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179748428] [2020-01-16 18:14:28,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179748428] [2020-01-16 18:14:28,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:28,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:28,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931303808] [2020-01-16 18:14:28,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:28,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:28,429 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:14:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:28,585 INFO L93 Difference]: Finished difference Result 1233 states and 4327 transitions. [2020-01-16 18:14:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:28,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:28,588 INFO L225 Difference]: With dead ends: 1233 [2020-01-16 18:14:28,588 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:14:28,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:14:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-01-16 18:14:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:14:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3108 transitions. [2020-01-16 18:14:28,611 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3108 transitions. Word has length 25 [2020-01-16 18:14:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:28,612 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3108 transitions. [2020-01-16 18:14:28,612 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3108 transitions. [2020-01-16 18:14:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:28,613 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:28,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:28,613 INFO L426 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1892802013, now seen corresponding path program 1110 times [2020-01-16 18:14:28,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:28,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099004817] [2020-01-16 18:14:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:29,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099004817] [2020-01-16 18:14:29,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:29,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:29,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842279609] [2020-01-16 18:14:29,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:29,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:29,016 INFO L87 Difference]: Start difference. First operand 783 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:14:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:29,166 INFO L93 Difference]: Finished difference Result 1234 states and 4323 transitions. [2020-01-16 18:14:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:29,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:29,169 INFO L225 Difference]: With dead ends: 1234 [2020-01-16 18:14:29,170 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:14:29,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:14:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 773. [2020-01-16 18:14:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-01-16 18:14:29,190 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-01-16 18:14:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:29,191 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-01-16 18:14:29,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-01-16 18:14:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:29,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:29,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:29,192 INFO L426 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 63957191, now seen corresponding path program 1111 times [2020-01-16 18:14:29,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:29,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401756778] [2020-01-16 18:14:29,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:29,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401756778] [2020-01-16 18:14:29,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:29,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:29,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625129572] [2020-01-16 18:14:29,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:29,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:29,581 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:14:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:29,753 INFO L93 Difference]: Finished difference Result 1213 states and 4281 transitions. [2020-01-16 18:14:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:29,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:29,756 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:14:29,756 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:14:29,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:14:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-01-16 18:14:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-01-16 18:14:29,777 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-01-16 18:14:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:29,777 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-01-16 18:14:29,777 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-01-16 18:14:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:29,778 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:29,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:29,778 INFO L426 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1034208805, now seen corresponding path program 1112 times [2020-01-16 18:14:29,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:29,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436284856] [2020-01-16 18:14:29,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:30,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436284856] [2020-01-16 18:14:30,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:30,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:30,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215998946] [2020-01-16 18:14:30,168 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:30,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:30,168 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:14:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:30,319 INFO L93 Difference]: Finished difference Result 1215 states and 4281 transitions. [2020-01-16 18:14:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:30,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:30,323 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:14:30,323 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:30,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:14:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-01-16 18:14:30,344 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-01-16 18:14:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:30,344 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-01-16 18:14:30,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-01-16 18:14:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:30,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:30,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:30,346 INFO L426 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1104192989, now seen corresponding path program 1113 times [2020-01-16 18:14:30,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:30,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996959946] [2020-01-16 18:14:30,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:30,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996959946] [2020-01-16 18:14:30,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:30,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749470171] [2020-01-16 18:14:30,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:30,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:30,737 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:14:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:30,895 INFO L93 Difference]: Finished difference Result 1207 states and 4265 transitions. [2020-01-16 18:14:30,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:30,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:30,899 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:14:30,899 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:14:30,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:14:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:14:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-01-16 18:14:30,920 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-01-16 18:14:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:30,920 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-01-16 18:14:30,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-01-16 18:14:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:30,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:30,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:30,922 INFO L426 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:30,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:30,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2126960123, now seen corresponding path program 1114 times [2020-01-16 18:14:30,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:30,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069408913] [2020-01-16 18:14:30,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:31,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069408913] [2020-01-16 18:14:31,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:31,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:31,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357805321] [2020-01-16 18:14:31,310 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:31,311 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:14:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:31,475 INFO L93 Difference]: Finished difference Result 1205 states and 4259 transitions. [2020-01-16 18:14:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:31,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:31,479 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:14:31,479 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:14:31,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:14:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:14:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:14:31,501 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:14:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:31,501 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:14:31,501 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:14:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:31,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:31,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] [2020-01-16 18:14:31,503 INFO L426 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1619748409, now seen corresponding path program 1115 times [2020-01-16 18:14:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:31,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395748277] [2020-01-16 18:14:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:31,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395748277] [2020-01-16 18:14:31,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:31,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:31,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879859523] [2020-01-16 18:14:31,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:31,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:31,886 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:14:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:32,039 INFO L93 Difference]: Finished difference Result 1211 states and 4271 transitions. [2020-01-16 18:14:32,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:32,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:32,042 INFO L225 Difference]: With dead ends: 1211 [2020-01-16 18:14:32,042 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:32,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:14:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:14:32,064 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:14:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:32,064 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:14:32,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:14:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:32,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:32,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:32,065 INFO L426 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2139989085, now seen corresponding path program 1116 times [2020-01-16 18:14:32,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:32,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967060520] [2020-01-16 18:14:32,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:32,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967060520] [2020-01-16 18:14:32,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:32,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:32,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399262497] [2020-01-16 18:14:32,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:32,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:32,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:32,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:32,446 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:14:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:32,615 INFO L93 Difference]: Finished difference Result 1207 states and 4261 transitions. [2020-01-16 18:14:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:32,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:32,618 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:14:32,618 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:14:32,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:14:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-01-16 18:14:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:14:32,639 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:14:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:32,639 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:14:32,639 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:14:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:32,640 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:32,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:32,640 INFO L426 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1223913401, now seen corresponding path program 1117 times [2020-01-16 18:14:32,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:32,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136029409] [2020-01-16 18:14:32,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:33,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136029409] [2020-01-16 18:14:33,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:33,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:33,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488848755] [2020-01-16 18:14:33,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:33,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:33,039 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:14:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:33,241 INFO L93 Difference]: Finished difference Result 1215 states and 4283 transitions. [2020-01-16 18:14:33,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:33,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:33,244 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:14:33,244 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:14:33,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:14:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 779. [2020-01-16 18:14:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:14:33,266 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:14:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:33,266 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:14:33,266 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:14:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:33,267 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:33,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:33,267 INFO L426 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash -232655579, now seen corresponding path program 1118 times [2020-01-16 18:14:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:33,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40495707] [2020-01-16 18:14:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:33,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-01-16 18:14:33,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40495707] [2020-01-16 18:14:33,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:33,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:33,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839337086] [2020-01-16 18:14:33,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:33,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:33,663 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:14:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:33,869 INFO L93 Difference]: Finished difference Result 1218 states and 4285 transitions. [2020-01-16 18:14:33,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:33,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:33,872 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:14:33,872 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:14:33,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:14:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2020-01-16 18:14:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:14:33,893 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:14:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:33,893 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:14:33,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:14:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:33,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:33,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:33,894 INFO L426 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 259221537, now seen corresponding path program 1119 times [2020-01-16 18:14:33,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:33,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405000167] [2020-01-16 18:14:33,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:34,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405000167] [2020-01-16 18:14:34,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:34,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107515465] [2020-01-16 18:14:34,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:34,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:34,285 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:14:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:34,448 INFO L93 Difference]: Finished difference Result 1208 states and 4265 transitions. [2020-01-16 18:14:34,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:34,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:34,451 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:14:34,451 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:14:34,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:14:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-01-16 18:14:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:14:34,472 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:14:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:34,472 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:14:34,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:14:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:34,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:34,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:34,473 INFO L426 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988671, now seen corresponding path program 1120 times [2020-01-16 18:14:34,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:34,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931460240] [2020-01-16 18:14:34,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931460240] [2020-01-16 18:14:34,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:34,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:34,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221833537] [2020-01-16 18:14:34,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:34,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:34,862 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:14:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:35,032 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-01-16 18:14:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:35,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:35,035 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:14:35,036 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:14:35,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:14:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:14:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:35,057 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:35,057 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:35,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:35,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:35,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:35,058 INFO L426 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1408354503, now seen corresponding path program 1121 times [2020-01-16 18:14:35,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:35,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698410937] [2020-01-16 18:14:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:35,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698410937] [2020-01-16 18:14:35,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:35,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:35,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875985674] [2020-01-16 18:14:35,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:35,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:35,457 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:35,622 INFO L93 Difference]: Finished difference Result 1214 states and 4275 transitions. [2020-01-16 18:14:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:35,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:35,626 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:14:35,626 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:14:35,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:14:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:14:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:35,646 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:35,647 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:35,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:35,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:35,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:35,648 INFO L426 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1946210081, now seen corresponding path program 1122 times [2020-01-16 18:14:35,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154250885] [2020-01-16 18:14:35,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:36,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-01-16 18:14:36,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154250885] [2020-01-16 18:14:36,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:36,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:36,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663247300] [2020-01-16 18:14:36,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:36,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:36,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:36,043 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:36,243 INFO L93 Difference]: Finished difference Result 1209 states and 4263 transitions. [2020-01-16 18:14:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:36,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:36,247 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:14:36,247 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:14:36,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:14:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 773. [2020-01-16 18:14:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:14:36,268 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:14:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:36,268 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:14:36,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:14:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:36,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:36,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:36,269 INFO L426 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1997374913, now seen corresponding path program 1123 times [2020-01-16 18:14:36,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:36,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230845477] [2020-01-16 18:14:36,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:36,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230845477] [2020-01-16 18:14:36,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:36,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:36,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572726185] [2020-01-16 18:14:36,661 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:36,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:36,661 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:14:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:36,838 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-01-16 18:14:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:36,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:36,842 INFO L225 Difference]: With dead ends: 1225 [2020-01-16 18:14:36,842 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:14:36,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:14:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-01-16 18:14:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-01-16 18:14:36,863 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-01-16 18:14:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:36,864 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-01-16 18:14:36,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-01-16 18:14:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:36,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:36,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:36,865 INFO L426 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1224507003, now seen corresponding path program 1124 times [2020-01-16 18:14:36,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:36,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902725594] [2020-01-16 18:14:36,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902725594] [2020-01-16 18:14:37,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:37,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:37,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611204532] [2020-01-16 18:14:37,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:37,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:37,269 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:14:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:37,429 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:14:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:37,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:37,433 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:14:37,433 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:14:37,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:14:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 775. [2020-01-16 18:14:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:37,454 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:37,454 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:37,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:37,455 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:37,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:37,455 INFO L426 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246117, now seen corresponding path program 1125 times [2020-01-16 18:14:37,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:37,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696966317] [2020-01-16 18:14:37,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:37,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-01-16 18:14:37,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696966317] [2020-01-16 18:14:37,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:37,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:37,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497205504] [2020-01-16 18:14:37,829 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:37,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:37,829 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:38,026 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:14:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:38,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:38,029 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:14:38,029 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:14:38,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:14:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-01-16 18:14:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:38,050 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:38,051 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:38,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:38,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:38,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:38,052 INFO L426 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1256016315, now seen corresponding path program 1126 times [2020-01-16 18:14:38,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229203891] [2020-01-16 18:14:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:38,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229203891] [2020-01-16 18:14:38,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:38,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:38,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471596240] [2020-01-16 18:14:38,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:38,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:38,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:38,431 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:38,624 INFO L93 Difference]: Finished difference Result 1212 states and 4271 transitions. [2020-01-16 18:14:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:38,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:38,628 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:14:38,628 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:14:38,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:14:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-01-16 18:14:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:38,650 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:38,650 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:38,650 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:38,651 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:38,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:38,651 INFO L426 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1812252325, now seen corresponding path program 1127 times [2020-01-16 18:14:38,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:38,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975489623] [2020-01-16 18:14:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:39,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975489623] [2020-01-16 18:14:39,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:39,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:39,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388681000] [2020-01-16 18:14:39,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:39,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:39,047 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:39,202 INFO L93 Difference]: Finished difference Result 1218 states and 4283 transitions. [2020-01-16 18:14:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:39,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:39,206 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:14:39,206 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:14:39,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:14:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:14:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:39,227 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:39,228 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:39,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:39,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:39,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:39,229 INFO L426 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1944859393, now seen corresponding path program 1128 times [2020-01-16 18:14:39,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:39,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60033911] [2020-01-16 18:14:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:39,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60033911] [2020-01-16 18:14:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973307937] [2020-01-16 18:14:39,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:39,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:39,621 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:39,787 INFO L93 Difference]: Finished difference Result 1213 states and 4271 transitions. [2020-01-16 18:14:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:39,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:39,791 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:14:39,791 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:39,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 771. [2020-01-16 18:14:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:14:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-01-16 18:14:39,814 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-01-16 18:14:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:39,814 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-01-16 18:14:39,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-01-16 18:14:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:39,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:39,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:39,815 INFO L426 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash 696773025, now seen corresponding path program 1129 times [2020-01-16 18:14:39,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:39,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812714625] [2020-01-16 18:14:39,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:40,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812714625] [2020-01-16 18:14:40,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:40,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:40,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685601331] [2020-01-16 18:14:40,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:40,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:40,231 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-01-16 18:14:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:40,414 INFO L93 Difference]: Finished difference Result 1220 states and 4303 transitions. [2020-01-16 18:14:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:40,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:40,418 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:14:40,418 INFO L226 Difference]: Without dead ends: 1207 [2020-01-16 18:14:40,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-01-16 18:14:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 781. [2020-01-16 18:14:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-01-16 18:14:40,440 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-01-16 18:14:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:40,440 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-01-16 18:14:40,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-01-16 18:14:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:40,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:40,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:40,441 INFO L426 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1667024639, now seen corresponding path program 1130 times [2020-01-16 18:14:40,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:40,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960110487] [2020-01-16 18:14:40,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:40,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960110487] [2020-01-16 18:14:40,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:40,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:40,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792087168] [2020-01-16 18:14:40,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:40,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:40,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:40,865 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-01-16 18:14:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:41,048 INFO L93 Difference]: Finished difference Result 1222 states and 4303 transitions. [2020-01-16 18:14:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:41,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:41,051 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:14:41,051 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:14:41,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:14:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 777. [2020-01-16 18:14:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-01-16 18:14:41,072 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-01-16 18:14:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:41,072 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-01-16 18:14:41,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-01-16 18:14:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:41,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:41,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:41,074 INFO L426 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059333, now seen corresponding path program 1131 times [2020-01-16 18:14:41,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:41,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713586412] [2020-01-16 18:14:41,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:41,513 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-01-16 18:14:41,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-01-16 18:14:41,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713586412] [2020-01-16 18:14:41,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:41,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:41,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370419435] [2020-01-16 18:14:41,519 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:41,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:41,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:41,519 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-01-16 18:14:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:41,697 INFO L93 Difference]: Finished difference Result 1219 states and 4297 transitions. [2020-01-16 18:14:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:41,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:41,701 INFO L225 Difference]: With dead ends: 1219 [2020-01-16 18:14:41,701 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:14:41,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:14:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-01-16 18:14:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-01-16 18:14:41,724 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-01-16 18:14:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:41,724 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-01-16 18:14:41,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-01-16 18:14:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:41,725 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:41,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:41,725 INFO L426 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1113298407, now seen corresponding path program 1132 times [2020-01-16 18:14:41,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:41,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87339099] [2020-01-16 18:14:41,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:42,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87339099] [2020-01-16 18:14:42,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:42,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:42,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394773290] [2020-01-16 18:14:42,143 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:42,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:42,143 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-01-16 18:14:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:42,304 INFO L93 Difference]: Finished difference Result 1220 states and 4295 transitions. [2020-01-16 18:14:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:42,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:42,308 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:14:42,308 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:14:42,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:14:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:14:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-01-16 18:14:42,330 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-01-16 18:14:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:42,330 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-01-16 18:14:42,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-01-16 18:14:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:42,332 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:42,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:42,332 INFO L426 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1638125023, now seen corresponding path program 1133 times [2020-01-16 18:14:42,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:42,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949184331] [2020-01-16 18:14:42,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:42,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949184331] [2020-01-16 18:14:42,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:42,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:42,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17889490] [2020-01-16 18:14:42,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:42,753 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-01-16 18:14:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:42,912 INFO L93 Difference]: Finished difference Result 1224 states and 4304 transitions. [2020-01-16 18:14:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:42,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:42,916 INFO L225 Difference]: With dead ends: 1224 [2020-01-16 18:14:42,916 INFO L226 Difference]: Without dead ends: 1209 [2020-01-16 18:14:42,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-01-16 18:14:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-01-16 18:14:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:14:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3104 transitions. [2020-01-16 18:14:42,937 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3104 transitions. Word has length 25 [2020-01-16 18:14:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:42,937 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3104 transitions. [2020-01-16 18:14:42,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3104 transitions. [2020-01-16 18:14:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:42,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:42,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] [2020-01-16 18:14:42,938 INFO L426 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1100269445, now seen corresponding path program 1134 times [2020-01-16 18:14:42,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:42,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030440204] [2020-01-16 18:14:42,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:43,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030440204] [2020-01-16 18:14:43,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:43,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:43,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500180775] [2020-01-16 18:14:43,360 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:43,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:43,361 INFO L87 Difference]: Start difference. First operand 782 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:14:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:43,521 INFO L93 Difference]: Finished difference Result 1223 states and 4297 transitions. [2020-01-16 18:14:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:43,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:43,525 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:14:43,525 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:14:43,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:14:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 773. [2020-01-16 18:14:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-01-16 18:14:43,547 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-01-16 18:14:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:43,547 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-01-16 18:14:43,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-01-16 18:14:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:43,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:43,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:43,548 INFO L426 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash -148198427, now seen corresponding path program 1135 times [2020-01-16 18:14:43,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:43,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653455559] [2020-01-16 18:14:43,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:43,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653455559] [2020-01-16 18:14:43,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:43,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:43,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951049471] [2020-01-16 18:14:43,957 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:43,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:43,958 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:14:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:44,113 INFO L93 Difference]: Finished difference Result 1210 states and 4272 transitions. [2020-01-16 18:14:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:44,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:44,117 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:14:44,117 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:14:44,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:14:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 779. [2020-01-16 18:14:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-01-16 18:14:44,138 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-01-16 18:14:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:44,138 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-01-16 18:14:44,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-01-16 18:14:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:44,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:44,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:44,139 INFO L426 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash 822053187, now seen corresponding path program 1136 times [2020-01-16 18:14:44,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:44,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121776029] [2020-01-16 18:14:44,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:44,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121776029] [2020-01-16 18:14:44,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:44,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:44,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382908596] [2020-01-16 18:14:44,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:44,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:44,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:44,547 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:14:44,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:44,698 INFO L93 Difference]: Finished difference Result 1212 states and 4272 transitions. [2020-01-16 18:14:44,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:44,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:44,701 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:14:44,702 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:14:44,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:14:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:14:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-01-16 18:14:44,723 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-01-16 18:14:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:44,723 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-01-16 18:14:44,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-01-16 18:14:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:44,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:44,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:44,724 INFO L426 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 892037371, now seen corresponding path program 1137 times [2020-01-16 18:14:44,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:44,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442485036] [2020-01-16 18:14:44,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:45,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442485036] [2020-01-16 18:14:45,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:45,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:45,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374133666] [2020-01-16 18:14:45,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:45,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:45,135 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-01-16 18:14:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:45,291 INFO L93 Difference]: Finished difference Result 1204 states and 4256 transitions. [2020-01-16 18:14:45,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:45,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:45,295 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:14:45,295 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:14:45,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:14:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:14:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-01-16 18:14:45,316 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-01-16 18:14:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:45,317 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-01-16 18:14:45,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-01-16 18:14:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:45,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:45,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:45,318 INFO L426 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804505, now seen corresponding path program 1138 times [2020-01-16 18:14:45,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:45,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625163842] [2020-01-16 18:14:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:45,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625163842] [2020-01-16 18:14:45,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:45,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445883541] [2020-01-16 18:14:45,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:45,727 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-01-16 18:14:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:45,915 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-01-16 18:14:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:45,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:45,919 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:14:45,919 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:14:45,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:14:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-01-16 18:14:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:45,941 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:45,941 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:45,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:45,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:45,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:45,943 INFO L426 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1831904027, now seen corresponding path program 1139 times [2020-01-16 18:14:45,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:45,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635834060] [2020-01-16 18:14:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:46,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-01-16 18:14:46,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635834060] [2020-01-16 18:14:46,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:46,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:46,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026410426] [2020-01-16 18:14:46,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:46,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:46,342 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:46,496 INFO L93 Difference]: Finished difference Result 1208 states and 4262 transitions. [2020-01-16 18:14:46,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:46,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:46,500 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:14:46,500 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:14:46,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:14:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:14:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:46,523 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:46,523 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:46,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:46,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:46,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:46,524 INFO L426 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1927833467, now seen corresponding path program 1140 times [2020-01-16 18:14:46,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:46,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125855778] [2020-01-16 18:14:46,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:46,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-01-16 18:14:46,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125855778] [2020-01-16 18:14:46,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:46,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:46,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186136358] [2020-01-16 18:14:46,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:46,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:46,918 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:47,065 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:14:47,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:47,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:47,068 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:14:47,068 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:14:47,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:14:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-01-16 18:14:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:14:47,090 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:14:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:47,090 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:14:47,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:14:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:47,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:47,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:47,092 INFO L426 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 67479333, now seen corresponding path program 1141 times [2020-01-16 18:14:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:47,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249989397] [2020-01-16 18:14:47,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:47,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249989397] [2020-01-16 18:14:47,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:47,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:47,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398249443] [2020-01-16 18:14:47,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:47,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:47,488 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:14:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:47,630 INFO L93 Difference]: Finished difference Result 1208 states and 4266 transitions. [2020-01-16 18:14:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:47,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:47,634 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:14:47,634 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:14:47,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:14:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-01-16 18:14:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:14:47,654 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:14:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:47,654 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:14:47,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:14:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:47,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:47,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:47,655 INFO L426 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1069240259, now seen corresponding path program 1142 times [2020-01-16 18:14:47,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808092700] [2020-01-16 18:14:47,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:48,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-01-16 18:14:48,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808092700] [2020-01-16 18:14:48,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:48,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:48,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043104858] [2020-01-16 18:14:48,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:48,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:48,047 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:14:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:48,190 INFO L93 Difference]: Finished difference Result 1209 states and 4264 transitions. [2020-01-16 18:14:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:48,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:48,193 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:14:48,193 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:14:48,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:14:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-01-16 18:14:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:48,213 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:48,213 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:48,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:48,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:48,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:48,214 INFO L426 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -375419807, now seen corresponding path program 1143 times [2020-01-16 18:14:48,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318307552] [2020-01-16 18:14:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:48,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318307552] [2020-01-16 18:14:48,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:48,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:48,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115832024] [2020-01-16 18:14:48,597 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:48,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:48,598 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:48,733 INFO L93 Difference]: Finished difference Result 1203 states and 4252 transitions. [2020-01-16 18:14:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:48,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:48,737 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:14:48,737 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:14:48,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:14:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-01-16 18:14:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:48,757 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:48,758 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:48,758 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:48,759 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:48,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:48,759 INFO L426 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 647347327, now seen corresponding path program 1144 times [2020-01-16 18:14:48,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:48,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597014762] [2020-01-16 18:14:48,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:49,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-01-16 18:14:49,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597014762] [2020-01-16 18:14:49,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:49,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:49,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901813630] [2020-01-16 18:14:49,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:49,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:49,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:49,139 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:49,278 INFO L93 Difference]: Finished difference Result 1201 states and 4246 transitions. [2020-01-16 18:14:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:49,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:49,282 INFO L225 Difference]: With dead ends: 1201 [2020-01-16 18:14:49,282 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:14:49,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:14:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-01-16 18:14:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:49,302 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:49,303 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:49,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:49,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:49,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:49,304 INFO L426 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1584716955, now seen corresponding path program 1145 times [2020-01-16 18:14:49,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:49,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196712538] [2020-01-16 18:14:49,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:49,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196712538] [2020-01-16 18:14:49,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:49,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:49,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258525945] [2020-01-16 18:14:49,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:49,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:49,696 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:49,845 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-01-16 18:14:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:49,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:49,848 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:14:49,849 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:14:49,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:14:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:14:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:49,869 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:49,869 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:49,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:49,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:49,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:49,871 INFO L426 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1637164961, now seen corresponding path program 1146 times [2020-01-16 18:14:49,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:49,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800109605] [2020-01-16 18:14:49,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:50,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800109605] [2020-01-16 18:14:50,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:50,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:50,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723567495] [2020-01-16 18:14:50,267 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:50,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:50,267 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:50,407 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-01-16 18:14:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:50,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:50,410 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:14:50,411 INFO L226 Difference]: Without dead ends: 1187 [2020-01-16 18:14:50,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-01-16 18:14:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 773. [2020-01-16 18:14:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:14:50,431 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:14:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:50,432 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:14:50,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:14:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:50,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:50,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:50,433 INFO L426 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1988547263, now seen corresponding path program 1147 times [2020-01-16 18:14:50,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:50,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134719692] [2020-01-16 18:14:50,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:50,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134719692] [2020-01-16 18:14:50,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:50,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:50,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390063048] [2020-01-16 18:14:50,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:50,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:50,822 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:14:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:50,976 INFO L93 Difference]: Finished difference Result 1216 states and 4282 transitions. [2020-01-16 18:14:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:50,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:50,979 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:14:50,979 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:14:50,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:14:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 780. [2020-01-16 18:14:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:14:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-01-16 18:14:50,999 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-01-16 18:14:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:50,999 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-01-16 18:14:50,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-01-16 18:14:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:51,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:51,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:51,001 INFO L426 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1768564455, now seen corresponding path program 1148 times [2020-01-16 18:14:51,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:51,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667468023] [2020-01-16 18:14:51,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:51,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667468023] [2020-01-16 18:14:51,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:51,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:51,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887287117] [2020-01-16 18:14:51,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:51,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:51,389 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:14:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:51,546 INFO L93 Difference]: Finished difference Result 1215 states and 4275 transitions. [2020-01-16 18:14:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:51,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:51,550 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:14:51,550 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:51,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:14:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:51,570 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:51,570 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:51,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:51,572 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:51,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] [2020-01-16 18:14:51,572 INFO L426 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1212328445, now seen corresponding path program 1149 times [2020-01-16 18:14:51,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:51,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906674511] [2020-01-16 18:14:51,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:51,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-01-16 18:14:51,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906674511] [2020-01-16 18:14:51,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:51,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:51,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971724258] [2020-01-16 18:14:51,950 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:51,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:51,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:51,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:51,951 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:52,093 INFO L93 Difference]: Finished difference Result 1210 states and 4265 transitions. [2020-01-16 18:14:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:52,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:52,096 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:14:52,096 INFO L226 Difference]: Without dead ends: 1195 [2020-01-16 18:14:52,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-01-16 18:14:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-01-16 18:14:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:52,116 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:52,116 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:52,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:52,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:52,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:52,117 INFO L426 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1747558247, now seen corresponding path program 1150 times [2020-01-16 18:14:52,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:52,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057572188] [2020-01-16 18:14:52,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:52,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057572188] [2020-01-16 18:14:52,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:52,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:52,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222591320] [2020-01-16 18:14:52,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:52,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:52,496 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:14:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:52,648 INFO L93 Difference]: Finished difference Result 1206 states and 4255 transitions. [2020-01-16 18:14:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:52,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:52,652 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:14:52,652 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:14:52,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:14:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-01-16 18:14:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:14:52,672 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:14:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:52,673 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:14:52,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:14:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:52,674 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:52,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:52,674 INFO L426 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1180819133, now seen corresponding path program 1151 times [2020-01-16 18:14:52,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:52,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596840361] [2020-01-16 18:14:52,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:53,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-01-16 18:14:53,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596840361] [2020-01-16 18:14:53,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:53,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:53,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354400521] [2020-01-16 18:14:53,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:53,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:53,058 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:14:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:53,204 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-01-16 18:14:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:53,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:53,207 INFO L225 Difference]: With dead ends: 1208 [2020-01-16 18:14:53,207 INFO L226 Difference]: Without dead ends: 1194 [2020-01-16 18:14:53,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-01-16 18:14:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-01-16 18:14:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:14:53,228 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:14:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:53,228 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:14:53,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:14:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:53,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:53,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:53,229 INFO L426 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2041062783, now seen corresponding path program 1152 times [2020-01-16 18:14:53,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:53,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826141201] [2020-01-16 18:14:53,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:53,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826141201] [2020-01-16 18:14:53,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:53,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:53,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841007847] [2020-01-16 18:14:53,608 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:53,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:53,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:53,609 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:14:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:53,745 INFO L93 Difference]: Finished difference Result 1205 states and 4251 transitions. [2020-01-16 18:14:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:53,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:53,749 INFO L225 Difference]: With dead ends: 1205 [2020-01-16 18:14:53,749 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:14:53,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:14:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 771. [2020-01-16 18:14:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:14:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-01-16 18:14:53,769 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-01-16 18:14:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:53,769 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-01-16 18:14:53,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-01-16 18:14:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:53,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:53,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:53,770 INFO L426 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1015408803, now seen corresponding path program 1153 times [2020-01-16 18:14:53,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:53,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845504999] [2020-01-16 18:14:53,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:54,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845504999] [2020-01-16 18:14:54,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:54,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:54,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156519644] [2020-01-16 18:14:54,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:54,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:54,146 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-01-16 18:14:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:54,300 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-01-16 18:14:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:54,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:54,303 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:14:54,303 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:14:54,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:14:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-01-16 18:14:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-01-16 18:14:54,323 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-01-16 18:14:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:54,323 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-01-16 18:14:54,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-01-16 18:14:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:54,325 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:54,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:54,325 INFO L426 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash -24150981, now seen corresponding path program 1154 times [2020-01-16 18:14:54,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:54,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167100308] [2020-01-16 18:14:54,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:54,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167100308] [2020-01-16 18:14:54,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:54,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:54,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567966407] [2020-01-16 18:14:54,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:54,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:54,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:54,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:54,694 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-01-16 18:14:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:54,832 INFO L93 Difference]: Finished difference Result 1226 states and 4309 transitions. [2020-01-16 18:14:54,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:54,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:54,835 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:14:54,836 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:14:54,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:14:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-01-16 18:14:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-01-16 18:14:54,856 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-01-16 18:14:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:54,856 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-01-16 18:14:54,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-01-16 18:14:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:54,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:54,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:54,857 INFO L426 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 910625275, now seen corresponding path program 1155 times [2020-01-16 18:14:54,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:54,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653486281] [2020-01-16 18:14:54,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:55,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653486281] [2020-01-16 18:14:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:55,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808775462] [2020-01-16 18:14:55,236 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:55,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:55,237 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-01-16 18:14:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:55,375 INFO L93 Difference]: Finished difference Result 1221 states and 4299 transitions. [2020-01-16 18:14:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:55,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:55,379 INFO L225 Difference]: With dead ends: 1221 [2020-01-16 18:14:55,379 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:14:55,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:14:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 781. [2020-01-16 18:14:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:14:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-01-16 18:14:55,400 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-01-16 18:14:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:55,400 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-01-16 18:14:55,400 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-01-16 18:14:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:55,401 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:55,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:55,401 INFO L426 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1912386201, now seen corresponding path program 1156 times [2020-01-16 18:14:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:55,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448610283] [2020-01-16 18:14:55,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:55,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448610283] [2020-01-16 18:14:55,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:55,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:55,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401172015] [2020-01-16 18:14:55,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:55,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:55,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:55,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:55,778 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-01-16 18:14:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:55,925 INFO L93 Difference]: Finished difference Result 1222 states and 4297 transitions. [2020-01-16 18:14:55,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:55,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:55,929 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:14:55,929 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:14:55,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:14:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-01-16 18:14:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3093 transitions. [2020-01-16 18:14:55,949 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3093 transitions. Word has length 25 [2020-01-16 18:14:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:55,949 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3093 transitions. [2020-01-16 18:14:55,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3093 transitions. [2020-01-16 18:14:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:55,950 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:55,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:55,950 INFO L426 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 965666653, now seen corresponding path program 1157 times [2020-01-16 18:14:55,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:55,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633691683] [2020-01-16 18:14:55,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:56,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633691683] [2020-01-16 18:14:56,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:56,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:56,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999647380] [2020-01-16 18:14:56,323 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:56,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:56,323 INFO L87 Difference]: Start difference. First operand 777 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:14:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:56,462 INFO L93 Difference]: Finished difference Result 1228 states and 4310 transitions. [2020-01-16 18:14:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:56,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:56,466 INFO L225 Difference]: With dead ends: 1228 [2020-01-16 18:14:56,466 INFO L226 Difference]: Without dead ends: 1212 [2020-01-16 18:14:56,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-01-16 18:14:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-01-16 18:14:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-01-16 18:14:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3102 transitions. [2020-01-16 18:14:56,486 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3102 transitions. Word has length 25 [2020-01-16 18:14:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:56,487 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 3102 transitions. [2020-01-16 18:14:56,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3102 transitions. [2020-01-16 18:14:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:56,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:56,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:56,488 INFO L426 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1718359685, now seen corresponding path program 1158 times [2020-01-16 18:14:56,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:56,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100445932] [2020-01-16 18:14:56,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:56,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100445932] [2020-01-16 18:14:56,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:56,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123128927] [2020-01-16 18:14:56,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:56,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:56,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:56,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:56,866 INFO L87 Difference]: Start difference. First operand 782 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:14:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:56,998 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-01-16 18:14:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:56,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:57,002 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:14:57,002 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:14:57,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:14:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 773. [2020-01-16 18:14:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:14:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-01-16 18:14:57,022 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-01-16 18:14:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:57,022 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-01-16 18:14:57,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-01-16 18:14:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:57,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:57,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:57,023 INFO L426 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1860380255, now seen corresponding path program 1159 times [2020-01-16 18:14:57,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:57,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974737450] [2020-01-16 18:14:57,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:57,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974737450] [2020-01-16 18:14:57,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:57,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:57,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908948866] [2020-01-16 18:14:57,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:57,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:57,390 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-01-16 18:14:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:57,525 INFO L93 Difference]: Finished difference Result 1213 states and 4276 transitions. [2020-01-16 18:14:57,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:57,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:57,529 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:14:57,529 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:14:57,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:14:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-01-16 18:14:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:14:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-01-16 18:14:57,549 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-01-16 18:14:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:57,549 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-01-16 18:14:57,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-01-16 18:14:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:57,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:57,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:57,550 INFO L426 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -869122433, now seen corresponding path program 1160 times [2020-01-16 18:14:57,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:57,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113955865] [2020-01-16 18:14:57,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:57,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113955865] [2020-01-16 18:14:57,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:57,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:57,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908321514] [2020-01-16 18:14:57,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:57,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:57,920 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:14:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:58,061 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-01-16 18:14:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:58,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:58,064 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:14:58,064 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:58,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:14:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-01-16 18:14:58,084 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-01-16 18:14:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:58,084 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-01-16 18:14:58,084 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-01-16 18:14:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:58,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:58,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:58,086 INFO L426 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash -377245317, now seen corresponding path program 1161 times [2020-01-16 18:14:58,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:58,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774613432] [2020-01-16 18:14:58,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:58,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774613432] [2020-01-16 18:14:58,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:58,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:58,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432104662] [2020-01-16 18:14:58,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:58,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:58,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:58,456 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-01-16 18:14:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:58,614 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-01-16 18:14:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:58,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:58,617 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:14:58,617 INFO L226 Difference]: Without dead ends: 1193 [2020-01-16 18:14:58,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-01-16 18:14:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-01-16 18:14:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-01-16 18:14:58,638 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-01-16 18:14:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:58,639 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-01-16 18:14:58,639 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-01-16 18:14:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:58,640 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:58,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:58,640 INFO L426 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 645521817, now seen corresponding path program 1162 times [2020-01-16 18:14:58,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:58,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580764578] [2020-01-16 18:14:58,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:59,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580764578] [2020-01-16 18:14:59,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:59,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:59,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7705664] [2020-01-16 18:14:59,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:59,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:59,008 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-01-16 18:14:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:59,165 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:14:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:59,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:59,169 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:14:59,169 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:14:59,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:14:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-01-16 18:14:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:14:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:14:59,189 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:14:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:59,189 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:14:59,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:14:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:59,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:59,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] [2020-01-16 18:14:59,191 INFO L426 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash 771887649, now seen corresponding path program 1163 times [2020-01-16 18:14:59,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:59,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546894741] [2020-01-16 18:14:59,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:14:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:14:59,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546894741] [2020-01-16 18:14:59,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:14:59,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:14:59,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954290083] [2020-01-16 18:14:59,548 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:14:59,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:14:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:14:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:14:59,549 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:14:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:14:59,724 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:14:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:14:59,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:14:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:14:59,727 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:14:59,727 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:14:59,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:14:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:14:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:14:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:14:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:14:59,747 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:14:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:14:59,747 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:14:59,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:14:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:14:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:14:59,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:14:59,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:14:59,748 INFO L426 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:14:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:14:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743227, now seen corresponding path program 1164 times [2020-01-16 18:14:59,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:14:59,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112389325] [2020-01-16 18:14:59,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:14:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:00,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112389325] [2020-01-16 18:15:00,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:00,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:00,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401133204] [2020-01-16 18:15:00,103 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:00,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:00,103 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:15:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:00,257 INFO L93 Difference]: Finished difference Result 1207 states and 4256 transitions. [2020-01-16 18:15:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:00,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:00,261 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:15:00,261 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:15:00,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:15:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-01-16 18:15:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:15:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:15:00,282 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:15:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:00,282 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:15:00,282 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:15:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:00,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:00,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:00,283 INFO L426 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash -356831903, now seen corresponding path program 1165 times [2020-01-16 18:15:00,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:00,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182347101] [2020-01-16 18:15:00,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:00,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182347101] [2020-01-16 18:15:00,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:00,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:00,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920990428] [2020-01-16 18:15:00,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:00,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:00,655 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:15:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:00,800 INFO L93 Difference]: Finished difference Result 1209 states and 4266 transitions. [2020-01-16 18:15:00,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:00,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:00,803 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:15:00,804 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:15:00,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:15:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-01-16 18:15:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-01-16 18:15:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-01-16 18:15:00,824 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-01-16 18:15:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:00,824 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-01-16 18:15:00,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-01-16 18:15:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:00,825 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:00,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] [2020-01-16 18:15:00,825 INFO L426 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash 644929023, now seen corresponding path program 1166 times [2020-01-16 18:15:00,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:00,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078672416] [2020-01-16 18:15:00,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:01,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078672416] [2020-01-16 18:15:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:01,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:01,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379208764] [2020-01-16 18:15:01,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:01,194 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:15:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:01,348 INFO L93 Difference]: Finished difference Result 1210 states and 4264 transitions. [2020-01-16 18:15:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:01,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:01,351 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:15:01,351 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:15:01,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:15:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-01-16 18:15:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:15:01,370 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:15:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:01,370 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:15:01,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:15:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:01,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:01,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:01,372 INFO L426 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -799731043, now seen corresponding path program 1167 times [2020-01-16 18:15:01,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:01,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280791240] [2020-01-16 18:15:01,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:01,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-01-16 18:15:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280791240] [2020-01-16 18:15:01,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:01,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:01,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099031971] [2020-01-16 18:15:01,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:01,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:01,739 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:15:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:01,878 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-01-16 18:15:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:01,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:01,881 INFO L225 Difference]: With dead ends: 1204 [2020-01-16 18:15:01,881 INFO L226 Difference]: Without dead ends: 1191 [2020-01-16 18:15:01,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-01-16 18:15:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-01-16 18:15:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:15:01,901 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:15:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:01,901 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:15:01,901 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:15:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:01,902 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:01,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:01,902 INFO L426 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 223036091, now seen corresponding path program 1168 times [2020-01-16 18:15:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:01,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129028493] [2020-01-16 18:15:01,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:02,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129028493] [2020-01-16 18:15:02,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:02,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:02,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301757010] [2020-01-16 18:15:02,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:02,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:02,279 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:15:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:02,448 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-01-16 18:15:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:02,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:02,451 INFO L225 Difference]: With dead ends: 1202 [2020-01-16 18:15:02,451 INFO L226 Difference]: Without dead ends: 1189 [2020-01-16 18:15:02,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-01-16 18:15:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-01-16 18:15:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:15:02,471 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:15:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:02,472 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:15:02,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:15:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:02,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:02,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:02,473 INFO L426 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2009028191, now seen corresponding path program 1169 times [2020-01-16 18:15:02,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:02,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110904625] [2020-01-16 18:15:02,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:02,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-01-16 18:15:02,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110904625] [2020-01-16 18:15:02,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:02,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:02,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436599390] [2020-01-16 18:15:02,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:02,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:02,856 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:15:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:02,995 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-01-16 18:15:02,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:02,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:02,998 INFO L225 Difference]: With dead ends: 1206 [2020-01-16 18:15:02,998 INFO L226 Difference]: Without dead ends: 1192 [2020-01-16 18:15:02,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-01-16 18:15:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-01-16 18:15:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:15:03,018 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:15:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:03,018 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:15:03,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:15:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:03,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:03,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:03,019 INFO L426 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1212853725, now seen corresponding path program 1170 times [2020-01-16 18:15:03,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:03,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731037366] [2020-01-16 18:15:03,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:03,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731037366] [2020-01-16 18:15:03,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:03,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:03,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437149230] [2020-01-16 18:15:03,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:03,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:03,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:03,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:03,382 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:15:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:03,555 INFO L93 Difference]: Finished difference Result 1203 states and 4246 transitions. [2020-01-16 18:15:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:03,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:03,559 INFO L225 Difference]: With dead ends: 1203 [2020-01-16 18:15:03,559 INFO L226 Difference]: Without dead ends: 1188 [2020-01-16 18:15:03,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-01-16 18:15:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 773. [2020-01-16 18:15:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:15:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:15:03,580 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:15:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:03,580 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:15:03,580 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:15:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:03,581 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:03,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:03,581 INFO L426 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:03,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:03,581 INFO L82 PathProgramCache]: Analyzing trace with hash 297371643, now seen corresponding path program 1171 times [2020-01-16 18:15:03,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:03,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244325436] [2020-01-16 18:15:03,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:03,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244325436] [2020-01-16 18:15:03,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:03,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:03,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570647910] [2020-01-16 18:15:03,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:03,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:03,943 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:15:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:04,106 INFO L93 Difference]: Finished difference Result 1220 states and 4288 transitions. [2020-01-16 18:15:04,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:04,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:04,109 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:15:04,109 INFO L226 Difference]: Without dead ends: 1204 [2020-01-16 18:15:04,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-01-16 18:15:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-01-16 18:15:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:15:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-01-16 18:15:04,130 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-01-16 18:15:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:04,130 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-01-16 18:15:04,130 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-01-16 18:15:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:04,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:04,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:04,131 INFO L426 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1908312601, now seen corresponding path program 1172 times [2020-01-16 18:15:04,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:04,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012850333] [2020-01-16 18:15:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:04,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012850333] [2020-01-16 18:15:04,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:04,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:04,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369839031] [2020-01-16 18:15:04,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:04,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:04,491 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:15:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:04,653 INFO L93 Difference]: Finished difference Result 1218 states and 4279 transitions. [2020-01-16 18:15:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:04,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:04,657 INFO L225 Difference]: With dead ends: 1218 [2020-01-16 18:15:04,657 INFO L226 Difference]: Without dead ends: 1199 [2020-01-16 18:15:04,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-01-16 18:15:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-01-16 18:15:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:15:04,677 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:15:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:04,677 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:15:04,677 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:15:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:04,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:04,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:04,678 INFO L426 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1391463231, now seen corresponding path program 1173 times [2020-01-16 18:15:04,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:04,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765892888] [2020-01-16 18:15:04,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:05,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765892888] [2020-01-16 18:15:05,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:05,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862016216] [2020-01-16 18:15:05,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:05,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:05,027 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:15:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:05,167 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-01-16 18:15:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:05,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:05,170 INFO L225 Difference]: With dead ends: 1214 [2020-01-16 18:15:05,170 INFO L226 Difference]: Without dead ends: 1198 [2020-01-16 18:15:05,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-01-16 18:15:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-01-16 18:15:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:15:05,191 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:15:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:05,191 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:15:05,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:15:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:05,192 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:05,192 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:05,192 INFO L426 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1929318809, now seen corresponding path program 1174 times [2020-01-16 18:15:05,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:05,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624968697] [2020-01-16 18:15:05,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:05,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624968697] [2020-01-16 18:15:05,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:05,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:05,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680547918] [2020-01-16 18:15:05,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:05,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:05,541 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:15:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:05,703 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-01-16 18:15:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:05,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:05,707 INFO L225 Difference]: With dead ends: 1209 [2020-01-16 18:15:05,707 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:15:05,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:15:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-01-16 18:15:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:15:05,727 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:15:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:05,727 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:15:05,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:15:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:05,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:05,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:05,728 INFO L426 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1401966335, now seen corresponding path program 1175 times [2020-01-16 18:15:05,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:05,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992379129] [2020-01-16 18:15:05,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:06,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992379129] [2020-01-16 18:15:06,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:06,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:06,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849941432] [2020-01-16 18:15:06,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:06,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:06,086 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:15:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:06,228 INFO L93 Difference]: Finished difference Result 1210 states and 4261 transitions. [2020-01-16 18:15:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:06,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:06,231 INFO L225 Difference]: With dead ends: 1210 [2020-01-16 18:15:06,231 INFO L226 Difference]: Without dead ends: 1196 [2020-01-16 18:15:06,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-01-16 18:15:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-01-16 18:15:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:15:06,251 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:15:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:06,251 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:15:06,251 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:15:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:06,252 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:06,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:06,252 INFO L426 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 328880955, now seen corresponding path program 1176 times [2020-01-16 18:15:06,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:06,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104863256] [2020-01-16 18:15:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:06,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104863256] [2020-01-16 18:15:06,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:06,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:06,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314886004] [2020-01-16 18:15:06,612 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:06,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:06,613 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:15:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:06,799 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-01-16 18:15:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:06,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:06,803 INFO L225 Difference]: With dead ends: 1207 [2020-01-16 18:15:06,803 INFO L226 Difference]: Without dead ends: 1190 [2020-01-16 18:15:06,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-01-16 18:15:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 771. [2020-01-16 18:15:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-01-16 18:15:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-01-16 18:15:06,828 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-01-16 18:15:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:06,828 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-01-16 18:15:06,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-01-16 18:15:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:06,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:06,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:06,830 INFO L426 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash 472498085, now seen corresponding path program 1177 times [2020-01-16 18:15:06,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:06,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756408904] [2020-01-16 18:15:06,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:07,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756408904] [2020-01-16 18:15:07,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:07,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:07,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635529610] [2020-01-16 18:15:07,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:07,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:07,247 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-01-16 18:15:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:07,384 INFO L93 Difference]: Finished difference Result 1241 states and 4353 transitions. [2020-01-16 18:15:07,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:07,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:07,388 INFO L225 Difference]: With dead ends: 1241 [2020-01-16 18:15:07,388 INFO L226 Difference]: Without dead ends: 1226 [2020-01-16 18:15:07,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-01-16 18:15:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 784. [2020-01-16 18:15:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-01-16 18:15:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-01-16 18:15:07,408 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-01-16 18:15:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:07,408 INFO L478 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-01-16 18:15:07,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-01-16 18:15:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:07,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:07,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:07,410 INFO L426 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -600587295, now seen corresponding path program 1178 times [2020-01-16 18:15:07,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:07,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766672875] [2020-01-16 18:15:07,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:07,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-01-16 18:15:07,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766672875] [2020-01-16 18:15:07,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:07,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:07,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211076266] [2020-01-16 18:15:07,804 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:07,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:07,804 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-01-16 18:15:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:07,954 INFO L93 Difference]: Finished difference Result 1242 states and 4349 transitions. [2020-01-16 18:15:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:07,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:07,958 INFO L225 Difference]: With dead ends: 1242 [2020-01-16 18:15:07,958 INFO L226 Difference]: Without dead ends: 1220 [2020-01-16 18:15:07,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-01-16 18:15:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-01-16 18:15:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:15:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-01-16 18:15:07,978 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-01-16 18:15:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:07,978 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-01-16 18:15:07,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-01-16 18:15:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:07,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:07,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:07,979 INFO L426 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1127939769, now seen corresponding path program 1179 times [2020-01-16 18:15:07,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:07,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579360858] [2020-01-16 18:15:07,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:08,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579360858] [2020-01-16 18:15:08,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:08,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:08,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084287369] [2020-01-16 18:15:08,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:08,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:08,374 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-01-16 18:15:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:08,512 INFO L93 Difference]: Finished difference Result 1238 states and 4341 transitions. [2020-01-16 18:15:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:08,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:08,515 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:15:08,515 INFO L226 Difference]: Without dead ends: 1223 [2020-01-16 18:15:08,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-01-16 18:15:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 783. [2020-01-16 18:15:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:15:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3107 transitions. [2020-01-16 18:15:08,536 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3107 transitions. Word has length 25 [2020-01-16 18:15:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:08,536 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3107 transitions. [2020-01-16 18:15:08,536 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3107 transitions. [2020-01-16 18:15:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:08,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:08,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:08,537 INFO L426 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash -590084191, now seen corresponding path program 1180 times [2020-01-16 18:15:08,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:08,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149945470] [2020-01-16 18:15:08,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:08,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149945470] [2020-01-16 18:15:08,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:08,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:08,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757917714] [2020-01-16 18:15:08,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:08,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:08,937 INFO L87 Difference]: Start difference. First operand 783 states and 3107 transitions. Second operand 10 states. [2020-01-16 18:15:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:09,077 INFO L93 Difference]: Finished difference Result 1237 states and 4334 transitions. [2020-01-16 18:15:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:09,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:09,081 INFO L225 Difference]: With dead ends: 1237 [2020-01-16 18:15:09,081 INFO L226 Difference]: Without dead ends: 1218 [2020-01-16 18:15:09,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-01-16 18:15:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-01-16 18:15:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-01-16 18:15:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-01-16 18:15:09,101 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-01-16 18:15:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:09,101 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-01-16 18:15:09,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-01-16 18:15:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:09,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:09,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:09,102 INFO L426 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1106933561, now seen corresponding path program 1181 times [2020-01-16 18:15:09,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:09,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732024218] [2020-01-16 18:15:09,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:09,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732024218] [2020-01-16 18:15:09,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:09,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:09,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307119780] [2020-01-16 18:15:09,494 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:09,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:09,494 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-01-16 18:15:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:09,652 INFO L93 Difference]: Finished difference Result 1240 states and 4340 transitions. [2020-01-16 18:15:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:09,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:09,655 INFO L225 Difference]: With dead ends: 1240 [2020-01-16 18:15:09,656 INFO L226 Difference]: Without dead ends: 1224 [2020-01-16 18:15:09,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-01-16 18:15:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 783. [2020-01-16 18:15:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-01-16 18:15:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-01-16 18:15:09,675 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-01-16 18:15:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:09,676 INFO L478 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-01-16 18:15:09,676 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-01-16 18:15:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:09,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:09,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] [2020-01-16 18:15:09,677 INFO L426 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 504007397, now seen corresponding path program 1182 times [2020-01-16 18:15:09,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:09,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020752993] [2020-01-16 18:15:09,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:10,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020752993] [2020-01-16 18:15:10,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:10,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:10,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394806153] [2020-01-16 18:15:10,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:10,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:10,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:10,065 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-01-16 18:15:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:10,227 INFO L93 Difference]: Finished difference Result 1238 states and 4331 transitions. [2020-01-16 18:15:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:10,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:10,231 INFO L225 Difference]: With dead ends: 1238 [2020-01-16 18:15:10,231 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:15:10,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:15:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 773. [2020-01-16 18:15:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:15:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-01-16 18:15:10,251 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-01-16 18:15:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:10,251 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-01-16 18:15:10,251 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-01-16 18:15:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:10,252 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:10,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:10,253 INFO L426 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 29598945, now seen corresponding path program 1183 times [2020-01-16 18:15:10,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:10,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85098568] [2020-01-16 18:15:10,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:10,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85098568] [2020-01-16 18:15:10,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:10,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:10,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820798069] [2020-01-16 18:15:10,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:10,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:10,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:10,635 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-01-16 18:15:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:10,782 INFO L93 Difference]: Finished difference Result 1229 states and 4315 transitions. [2020-01-16 18:15:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:10,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:10,785 INFO L225 Difference]: With dead ends: 1229 [2020-01-16 18:15:10,785 INFO L226 Difference]: Without dead ends: 1214 [2020-01-16 18:15:10,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-01-16 18:15:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-01-16 18:15:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-01-16 18:15:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-01-16 18:15:10,805 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-01-16 18:15:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:10,805 INFO L478 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-01-16 18:15:10,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-01-16 18:15:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:10,806 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:10,806 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:10,806 INFO L426 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1043486435, now seen corresponding path program 1184 times [2020-01-16 18:15:10,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:10,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341064849] [2020-01-16 18:15:10,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:11,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341064849] [2020-01-16 18:15:11,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:11,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:11,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792963607] [2020-01-16 18:15:11,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:11,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:11,194 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-01-16 18:15:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:11,357 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-01-16 18:15:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:11,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:11,360 INFO L225 Difference]: With dead ends: 1230 [2020-01-16 18:15:11,360 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:15:11,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:15:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 775. [2020-01-16 18:15:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-01-16 18:15:11,380 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-01-16 18:15:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:11,381 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-01-16 18:15:11,381 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-01-16 18:15:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:11,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:11,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:11,382 INFO L426 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash -476747321, now seen corresponding path program 1185 times [2020-01-16 18:15:11,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:11,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200776587] [2020-01-16 18:15:11,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:11,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200776587] [2020-01-16 18:15:11,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:11,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:11,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563952142] [2020-01-16 18:15:11,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:11,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:11,741 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-01-16 18:15:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:11,890 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-01-16 18:15:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:11,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:11,893 INFO L225 Difference]: With dead ends: 1220 [2020-01-16 18:15:11,893 INFO L226 Difference]: Without dead ends: 1205 [2020-01-16 18:15:11,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-01-16 18:15:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-01-16 18:15:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-01-16 18:15:11,913 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-01-16 18:15:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:11,913 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-01-16 18:15:11,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-01-16 18:15:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:11,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:11,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:11,914 INFO L426 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1011977123, now seen corresponding path program 1186 times [2020-01-16 18:15:11,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:11,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977960164] [2020-01-16 18:15:11,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:12,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977960164] [2020-01-16 18:15:12,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:12,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:12,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436294366] [2020-01-16 18:15:12,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:12,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:12,277 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-01-16 18:15:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:12,419 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-01-16 18:15:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:12,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:12,422 INFO L225 Difference]: With dead ends: 1216 [2020-01-16 18:15:12,422 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:15:12,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:15:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-01-16 18:15:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:15:12,442 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:15:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:12,442 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:15:12,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:15:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:12,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:12,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:12,444 INFO L426 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:12,444 INFO L82 PathProgramCache]: Analyzing trace with hash -455741113, now seen corresponding path program 1187 times [2020-01-16 18:15:12,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:12,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849974463] [2020-01-16 18:15:12,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:12,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849974463] [2020-01-16 18:15:12,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:12,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122671548] [2020-01-16 18:15:12,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:12,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:12,824 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:15:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:12,975 INFO L93 Difference]: Finished difference Result 1222 states and 4293 transitions. [2020-01-16 18:15:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:12,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:12,978 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:15:12,979 INFO L226 Difference]: Without dead ends: 1206 [2020-01-16 18:15:12,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-01-16 18:15:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-01-16 18:15:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:15:13,001 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:15:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:13,001 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:15:13,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:15:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:13,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:13,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:13,002 INFO L426 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 82114465, now seen corresponding path program 1188 times [2020-01-16 18:15:13,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:13,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214218442] [2020-01-16 18:15:13,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:13,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214218442] [2020-01-16 18:15:13,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:13,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335327281] [2020-01-16 18:15:13,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:13,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:13,378 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:15:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:13,533 INFO L93 Difference]: Finished difference Result 1217 states and 4281 transitions. [2020-01-16 18:15:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:13,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:13,536 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:15:13,536 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:15:13,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:15:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 773. [2020-01-16 18:15:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:15:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-01-16 18:15:13,558 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-01-16 18:15:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:13,558 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-01-16 18:15:13,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-01-16 18:15:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:13,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:13,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:13,559 INFO L426 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 355195169, now seen corresponding path program 1189 times [2020-01-16 18:15:13,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:13,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807040210] [2020-01-16 18:15:13,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:13,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807040210] [2020-01-16 18:15:13,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:13,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:13,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050681102] [2020-01-16 18:15:13,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:13,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:13,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:13,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:13,943 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-01-16 18:15:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:14,109 INFO L93 Difference]: Finished difference Result 1223 states and 4299 transitions. [2020-01-16 18:15:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:14,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:14,113 INFO L225 Difference]: With dead ends: 1223 [2020-01-16 18:15:14,113 INFO L226 Difference]: Without dead ends: 1208 [2020-01-16 18:15:14,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-01-16 18:15:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-01-16 18:15:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:15:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-01-16 18:15:14,134 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-01-16 18:15:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:14,134 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-01-16 18:15:14,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-01-16 18:15:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:14,135 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:14,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] [2020-01-16 18:15:14,135 INFO L426 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:14,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 893050747, now seen corresponding path program 1190 times [2020-01-16 18:15:14,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:14,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830504787] [2020-01-16 18:15:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:14,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-01-16 18:15:14,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830504787] [2020-01-16 18:15:14,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:14,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:14,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778899929] [2020-01-16 18:15:14,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:14,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:14,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:14,521 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-01-16 18:15:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:14,657 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-01-16 18:15:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:14,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:14,661 INFO L225 Difference]: With dead ends: 1222 [2020-01-16 18:15:14,661 INFO L226 Difference]: Without dead ends: 1203 [2020-01-16 18:15:14,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-01-16 18:15:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-01-16 18:15:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-01-16 18:15:14,681 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-01-16 18:15:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:14,681 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-01-16 18:15:14,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-01-16 18:15:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:14,682 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:14,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] [2020-01-16 18:15:14,683 INFO L426 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1449286757, now seen corresponding path program 1191 times [2020-01-16 18:15:14,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:14,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526119686] [2020-01-16 18:15:14,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:15,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526119686] [2020-01-16 18:15:15,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:15,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:15,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788031546] [2020-01-16 18:15:15,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:15,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:15,051 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-01-16 18:15:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:15,190 INFO L93 Difference]: Finished difference Result 1217 states and 4282 transitions. [2020-01-16 18:15:15,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:15,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:15,193 INFO L225 Difference]: With dead ends: 1217 [2020-01-16 18:15:15,193 INFO L226 Difference]: Without dead ends: 1202 [2020-01-16 18:15:15,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-01-16 18:15:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-01-16 18:15:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-01-16 18:15:15,214 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-01-16 18:15:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:15,214 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-01-16 18:15:15,214 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-01-16 18:15:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:15,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:15,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] [2020-01-16 18:15:15,215 INFO L426 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash 914056955, now seen corresponding path program 1192 times [2020-01-16 18:15:15,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:15,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383563811] [2020-01-16 18:15:15,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:15,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383563811] [2020-01-16 18:15:15,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:15,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:15,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801530071] [2020-01-16 18:15:15,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:15,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:15,583 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-01-16 18:15:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:15,742 INFO L93 Difference]: Finished difference Result 1213 states and 4272 transitions. [2020-01-16 18:15:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:15,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:15,745 INFO L225 Difference]: With dead ends: 1213 [2020-01-16 18:15:15,745 INFO L226 Difference]: Without dead ends: 1200 [2020-01-16 18:15:15,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-01-16 18:15:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-01-16 18:15:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-01-16 18:15:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-01-16 18:15:15,765 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-01-16 18:15:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:15,765 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-01-16 18:15:15,765 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-01-16 18:15:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:15,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:15,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:15,767 INFO L426 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1480796069, now seen corresponding path program 1193 times [2020-01-16 18:15:15,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:15,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985274041] [2020-01-16 18:15:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:16,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-01-16 18:15:16,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985274041] [2020-01-16 18:15:16,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:16,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:16,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452930861] [2020-01-16 18:15:16,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:16,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:16,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:16,137 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-01-16 18:15:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:16,288 INFO L93 Difference]: Finished difference Result 1215 states and 4276 transitions. [2020-01-16 18:15:16,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:16,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:16,291 INFO L225 Difference]: With dead ends: 1215 [2020-01-16 18:15:16,291 INFO L226 Difference]: Without dead ends: 1201 [2020-01-16 18:15:16,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-01-16 18:15:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-01-16 18:15:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-01-16 18:15:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-01-16 18:15:16,311 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-01-16 18:15:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:16,311 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-01-16 18:15:16,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-01-16 18:15:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:16,312 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:16,312 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:16,312 INFO L426 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 407710689, now seen corresponding path program 1194 times [2020-01-16 18:15:16,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:16,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938328647] [2020-01-16 18:15:16,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:16,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938328647] [2020-01-16 18:15:16,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:16,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:16,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529695438] [2020-01-16 18:15:16,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:16,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:16,688 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-01-16 18:15:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:16,840 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-01-16 18:15:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:16,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:16,844 INFO L225 Difference]: With dead ends: 1212 [2020-01-16 18:15:16,844 INFO L226 Difference]: Without dead ends: 1197 [2020-01-16 18:15:16,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-01-16 18:15:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 773. [2020-01-16 18:15:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-01-16 18:15:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-01-16 18:15:16,864 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-01-16 18:15:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:16,864 INFO L478 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-01-16 18:15:16,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-01-16 18:15:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:16,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:16,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:16,865 INFO L426 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -66697763, now seen corresponding path program 1195 times [2020-01-16 18:15:16,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:16,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108415681] [2020-01-16 18:15:16,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:15:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:15:17,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108415681] [2020-01-16 18:15:17,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:15:17,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-01-16 18:15:17,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697982723] [2020-01-16 18:15:17,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-01-16 18:15:17,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:15:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-01-16 18:15:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-01-16 18:15:17,244 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-01-16 18:15:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:15:17,412 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-01-16 18:15:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-01-16 18:15:17,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-01-16 18:15:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:15:17,415 INFO L225 Difference]: With dead ends: 1226 [2020-01-16 18:15:17,416 INFO L226 Difference]: Without dead ends: 1210 [2020-01-16 18:15:17,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-01-16 18:15:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-01-16 18:15:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-01-16 18:15:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-01-16 18:15:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-01-16 18:15:17,435 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-01-16 18:15:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:15:17,435 INFO L478 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-01-16 18:15:17,435 INFO L479 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-01-16 18:15:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-01-16 18:15:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-01-16 18:15:17,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:15:17,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:15:17,436 INFO L426 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:15:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:15:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243195, now seen corresponding path program 1196 times [2020-01-16 18:15:17,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:15:17,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932081564] [2020-01-16 18:15:17,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:15:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-01-16 18:15:17,731 WARN L209 SmtUtils]: Removed 17 from assertion stack [2020-01-16 18:15:17,732 WARN L543 AbstractCegarLoop]: Verification canceled [2020-01-16 18:15:17,734 WARN L227 ceAbstractionStarter]: Timeout [2020-01-16 18:15:17,735 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 06:15:17 BasicIcfg [2020-01-16 18:15:17,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 18:15:17,736 INFO L168 Benchmark]: Toolchain (without parser) took 772050.85 ms. Allocated memory was 146.8 MB in the beginning and 1.0 GB in the end (delta: 887.1 MB). Free memory was 120.7 MB in the beginning and 525.6 MB in the end (delta: -404.9 MB). Peak memory consumption was 482.2 MB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,736 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 146.8 MB. Free memory was 120.5 MB in the beginning and 118.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,736 INFO L168 Benchmark]: Boogie Preprocessor took 15.38 ms. Allocated memory is still 146.8 MB. Free memory was 118.8 MB in the beginning and 117.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,737 INFO L168 Benchmark]: RCFGBuilder took 309.92 ms. Allocated memory is still 146.8 MB. Free memory was 117.7 MB in the beginning and 104.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,737 INFO L168 Benchmark]: TraceAbstraction took 771692.39 ms. Allocated memory was 146.8 MB in the beginning and 1.0 GB in the end (delta: 887.1 MB). Free memory was 104.1 MB in the beginning and 525.6 MB in the end (delta: -421.4 MB). Peak memory consumption was 465.6 MB. Max. memory is 7.1 GB. [2020-01-16 18:15:17,738 INFO L335 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 146.8 MB. Free memory was 120.5 MB in the beginning and 118.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 15.38 ms. Allocated memory is still 146.8 MB. Free memory was 118.8 MB in the beginning and 117.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.92 ms. Allocated memory is still 146.8 MB. Free memory was 117.7 MB in the beginning and 104.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 771692.39 ms. Allocated memory was 146.8 MB in the beginning and 1.0 GB in the end (delta: 887.1 MB). Free memory was 104.1 MB in the beginning and 525.6 MB in the end (delta: -421.4 MB). Peak memory consumption was 465.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 68 ProgramPointsBefore, 58 ProgramPointsAfterwards, 99 TransitionsBefore, 90 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 504 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 532 CheckedPairsTotal, 9 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 50 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 771.4s, OverallIterations: 1203, TraceHistogramMax: 1, AutomataDifference: 203.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 108506 SDtfs, 159424 SDslu, 276049 SDs, 0 SdLazy, 82052 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 84.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11971 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 10762 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7170 ImplicationChecksByTransitivity, 594.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6818occurred 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: 28.2s AutomataMinimizationTime, 1202 MinimizatonAttempts, 643982 StatesRemovedByMinimization, 1195 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 526.7s InterpolantComputationTime, 30050 NumberOfCodeBlocks, 30050 NumberOfCodeBlocksAsserted, 1202 NumberOfCheckSat, 28848 ConstructedInterpolants, 0 QuantifiedInterpolants, 20290896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1202 InterpolantComputations, 1202 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